用ASP的默认否定和强否定，优雅解决道德逻辑中的经典悖论。
Modeling Deontic Modal Logic in ASP
- 用ASP的全局约束表示义务、禁止和允许
- 自然化解开数十年的道德逻辑悖论
- 适合知识表示与条件义务建模的研究者
我们研究了道德模态逻辑的实现问题。通过答案集编程（ASP）中的默认否定（否定即失败）和强否定，能够简洁直接地表达（道德）模态算子。我们提出使用ASP的全局约束来表示道德模态逻辑中的义务、禁止和许可。结果表明，该方法可简单而优雅地解决多年来困扰该领域的各种悖论。此外，该方法还适用于知识表示中对条件义务和条件禁止的建模。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。