Abstract
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.
Related Papers
Step-by-Step Video-to-Audio Synthesis via Negative Audio Guidance2025-06-26Thunder-NUBench: A Benchmark for LLMs' Sentence-Level Negation Understanding2025-06-17Propositional Logic for Probing Generalization in Neural Networks2025-06-10Antithetic Noise in Diffusion Models2025-06-06ReXVQA: A Large-scale Visual Question Answering Benchmark for Generalist Chest X-ray Understanding2025-06-04Probing the Geometry of Truth: Consistency and Generalization of Truth Directions in LLMs Across Logical Transformations and Question Answering Tasks2025-06-01Three Kinds of Negation in Knowledge and Their Mathematical Foundations2025-05-30On Fairness of Task Arithmetic: The Role of Task Vectors2025-05-30