Identifying the class of maxi-consistent operators in argumentation

DOI10.1613/JAIR.3860MaRDI QIDQ4927418zbMATH OpenOpenAlexWikidataFDO

Authors Srdjan Vesic

Publication date 20 June 2013

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.0573

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Abstract: Dung's abstract argumentation theory can be seen as a general framework for non-monotonic reasoning. An important question is then: what is the class of logics that can be subsumed as instantiations of this theory? The goal of this paper is to identify and study the large class of logic-based instantiations of Dung's theory which correspond to the maxi-consistent operator, i.e. to the function which returns maximal consistent subsets of an inconsistent knowledge base. In other words, we study the class of instantiations where very extension of the argumentation system corresponds to exactly one maximal consistent subset of the knowledge base. We show that an attack relation belonging to this class must be conflict-dependent, must not be valid, must not be conflict-complete, must not be symmetric etc. Then, we show that some attack relations serve as lower or upper bounds of the class (e.g. if an attack relation contains canonical undercut then it is not a member of this class). By using our results, we show for all existing attack relations whether or not they belong to this class. We also define new attack relations which are members of this class. Finally, we interpret our results and discuss more general questions, like: what is the added value of argumentation in such a setting? We believe that this work is a first step towards achieving our long-term goal, which is to better understand the role of argumentation and, particularly, the expressivity of logic-based instantiations of Dung-style argumentation frameworks.

Recommendations

• Maxi-consistent operators in argumentation
• Beyond maxi-consistent argumentation operators
• Logical limits of abstract argumentation frameworks
• A review of the relations between logical argumentation and reasoning with maximal consistency
• A Logic of Abstract Argumentation

Cited in

(12)

• Minimal sets on propositional formulae. Problems and reductions
• Logic-based argumentation with existential rules
• A generalized proof-theoretic approach to logical argumentation based on hypersequents
• Simple contrapositive assumption-based argumentation. II: Reasoning with preferences
• Similarity measures based on compiled arguments
• Simple contrapositive assumption-based argumentation frameworks
• A review of the relations between logical argumentation and reasoning with maximal consistency
• Beyond maxi-consistent argumentation operators
• Maxi-consistent operators in argumentation
• Reasoning with maximal consistency by argumentative approaches
• Syntactic reasoning with conditional probabilities in deductive argumentation
• A postulate-driven study of logical argumentation

This page was built for publication: Identifying the class of maxi-consistent operators in argumentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4927418)