[2508.16242] A Reduction of Input/Output Logics to SAT

Computer Science > Logic in Computer Science arXiv:2508.16242 (cs) [Submitted on 22 Aug 2025 (v1), last revised 27 Feb 2026 (this version, v2)] Title:A Reduction of Input/Output Logics to SAT Authors:Alexander Steen View a PDF of the paper titled A Reduction of Input/Output Logics to SAT, by Alexander Steen View PDF HTML (experimental) Abstract:Deontic logics are formalisms for reasoning over norms, obligations, permissions and prohibitions. Input/Output (I/O) Logics are a particular family of so-called norm-based deontic logics that formalize conditional norms outside of the underlying object logic language, where conditional norms do not carry a truth-value themselves. In this paper, an automation approach for I/O logics is presented that makes use of suitable reductions to (sequences of) propositional satisfiability problems. A prototypical implementation, named rio (reasoner for input/output logics), of the proposed procedures is presented and applied to illustrative examples. Comments: Subjects: Logic in Computer Science (cs.LO); Artificial Intelligence (cs.AI) MSC classes: 68T27 ACM classes: I.2.3 Cite as: arXiv:2508.16242 [cs.LO]   (or arXiv:2508.16242v2 [cs.LO] for this version)   https://doi.org/10.48550/arXiv.2508.16242 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Alexander Steen [view email] [v1] Fri, 22 Aug 2025 09:22:26 UTC (41 KB) [v2] Fri, 27 Feb 2026 09:08:50 UTC (43 KB) Full-text links: Access Paper: View a PDF of the paper ti...