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 Operators With 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 modal operators of deontic logic using default negation-as-failure and strong negation available in Answer Set Programming (ASP). We propose a way to represent obligations and prohibitions of deontic logic using global constraints of ASP, and show that the proposed representation elegantly resolves several paradoxes of deontic logic.

Takeaways, Limitations

Takeaways: It presents a new possibility to solve the paradoxes of deontic logic by suggesting a deontic logic expression method using global constraints and negation of ASP. Deontic logic problems can be effectively solved by utilizing ASP's efficient inference engine.
Limitations: Lack of specific discussion on practical applications of the proposed method. Further research is needed on the applicability and generalizability to various types of obligation logic systems. The requirement of prior knowledge of ASP may limit accessibility.
👍