Modeling Deontic Modal Logic in the s(CASP) Goal-directed Predicate Answer Set Programming System
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918466917761024 |
|---|---|
| author | Gupta, Gopal Rajasekharan, Abhiramon Tudor, Alexis R. Salazar, Elmer Arias, Joaquín |
| author_facet | Gupta, Gopal Rajasekharan, Abhiramon Tudor, Alexis R. Salazar, Elmer Arias, Joaquín |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_05519 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Modeling Deontic Modal Logic in the s(CASP) Goal-directed Predicate Answer Set Programming System Gupta, Gopal Rajasekharan, Abhiramon Tudor, Alexis R. Salazar, Elmer Arias, Joaquín Artificial Intelligence Logic in Computer Science 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. |
| title | Modeling Deontic Modal Logic in the s(CASP) Goal-directed Predicate Answer Set Programming System |
| topic | Artificial Intelligence Logic in Computer Science |
| url | https://arxiv.org/abs/2507.05519 |