Modeling Deontic Modal Logic in the s(CASP) Goal-directed Predicate Answer Set Programming System
By: Gopal Gupta , Abhiramon Rajasekharan , Alexis R. Tudor and more
Potential Business Impact:
Solves tricky "should" and "must not" logic puzzles.
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.
Similar Papers
Modeling Deontic Modal Logic in the s(CASP) Goal-directed Predicate Answer Set Programming System
Artificial Intelligence
Solves logic puzzles about rules and what's allowed.
A framework for Conditional Reasoning in Answer Set Programming
Artificial Intelligence
Lets computers reason with "if this, then that" rules.
Towards Constraint Temporal Answer Set Programming
Artificial Intelligence
Helps computers understand changing things over time.