Modeling Deontic Modal Logic in the s(CASP) Goal-directed Predicate Answer Set Programming System
This work addresses a specific problem in formal logic and AI for researchers in computational logic, but it is incremental as it builds on existing ASP systems.
The paper tackled implementing deontic modal logic by expressing modal operators using default and strong negation in answer set programming, and it resolved various paradoxes of deontic modal logic elegantly.
We consider the problem of implementing deontic modal logic. We show how (deontic) modal operators can be expressed elegantly 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 and impermissibilities of deontic modal logic. We show that our proposed representation results in the various paradoxes of deontic modal logic being elegantly resolved.