Daily Arxiv

This is a page that curates AI-related papers published worldwide.
All content here is summarized using Google Gemini and operated on a non-profit basis.
Copyright for each paper belongs to the authors and their institutions; please make sure to credit the source when sharing.

Modeling Deontic Modal Logic in the s(CASP) Goal-directed Predicate Answer Set Programming System

Created by
  • Haebom

Author

Gopal Gupta, Abhiramon Rajasekharan, Alexis R. Tudor, Elmer Salazar, Joaqu in Arias

Outline

This paper addresses the problem of implementing deontic modal logic. We present an elegant way to represent operators in deontic logic using the negation-as-failure and strong negation features of Answer Set Programming (ASP). We use ASP's global constraints to express obligations and prohibitions in deontic logic, and demonstrate that the proposed representation elegantly resolves various paradoxes of deontic logic.

Takeaways, Limitations

Takeaways: Presents a new method for implementing mandatory logic using ASP, provides a new perspective on resolving the paradox of mandatory logic, and presents an efficient expression method using global constraints.
Limitations: Prior knowledge of ASP is required, further research is needed on the applicability and scalability of the proposed method to general obligation logic systems, and comparative analysis with other obligation logic implementation methods is lacking.
👍