Defeasible Normative Reasoning: A Proof-Theoretic Integration of Logical Argumentation
DOI:
https://doi.org/10.1609/aaai.v38i9.28913Keywords:
KRR: Nonmonotonic Reasoning, KRR: Argumentation, KRR: Common-Sense ReasoningAbstract
We present a novel computational approach to resolving conflicts among norms by nonmonotonic normative reasoning (in constrained I/O logics). Our approach extends standard sequent-based proof systems and makes them more adequate to nonmonotonic reasoning by adding to the sequents annotations that keep track of what is known about the defeasible status of the derived sequents. This makes transparent the reasons according to which norms should be applicable or inapplicable, and accordingly the sequents that make use of such norms are accepted or retracted. We also show that this proof theoretic method has tight links to the semantics of formal argumentation frameworks. The outcome of this paper is thus a threefold characterization result that relates, in the context of nonmonotonic normative reasoning, three traditional ingredients of AI-based reasoning methods: maximally consistent sets of premises (in constrained I/O logics), derived sequents (which are accepted in corresponding annotated sequent calculi), and logical arguments (that belong to the grounded extensions of the induced logical argumentation frameworks).Downloads
Published
2024-03-24
How to Cite
Arieli, O., van Berkel, K., & Straßer, C. (2024). Defeasible Normative Reasoning: A Proof-Theoretic Integration of Logical Argumentation. Proceedings of the AAAI Conference on Artificial Intelligence, 38(9), 10450-10458. https://doi.org/10.1609/aaai.v38i9.28913
Issue
Section
AAAI Technical Track on Knowledge Representation and Reasoning