Modeling Deontic Modal Logic in ASP

We consider the problem of implementing deontic modal logic.We show how (deontic) modal operators can be elegantly and directly expressed using default negation (negation-as-failure) and strong negation present in answer set programming (ASP).We propose using global constraints of ASP to represent obligations, prohibitions, and permissions in deontic modal logic.We show that our proposed representation results in the various decades-old paradoxes of deontic modal logic being simply and elegantly resolved.Our method also serves as a means for modeling conditional obligations and conditional prohibitions in knowledge representation.