On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation

DOI10.1016/J.ARTINT.2018.07.001zbMath1451.68265OpenAlexW2884696316WikidataQ62042292 ScholiaQ62042292MaRDI QIDQ1711893

Francesca Toni, Claudia Schulz

Publication date: 18 January 2019

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10044/1/62024

zbMATH Keywords

dynamicsnon-existenceinconsistencydebuggingstable semanticsabstract argumentationpreferred semanticsundecidedness

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (4)

Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ Topological conditions and solutions for repairing argumentation frameworks ⋮ Fuzzy labeling semantics for quantitative argumentation ⋮ Graded labellings for abstract argumentation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approach to decision making based on dynamic argumentation systems
• Toward incremental computation of argumentation semantics: a decomposition-based approach
• On the input/output behavior of argumentation frameworks
• Dynamics of argumentation systems: a division-based method
• Using arguments for making and explaining decisions
• Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack
• A theory of diagnosis from first principles
• Coherence in finite argument systems.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• A logical account of formal argumentation
• Methods for solving reasoning problems in abstract argumentation -- a survey
• On the equivalence between logic programming semantics and argumentation semantics
• SCC-recursiveness: a general schema for argumentation semantics
• Measuring Inconsistency in Answer Set Programs
• Rewriting Rules for the Computation of Goal-Oriented Changes in an Argumentation System
• Parameterized Splitting: A Simple Modification-Based Approach
• A Translation-Based Approach for Revision of Argumentation Frameworks
• Dilemmas and paradoxes: cycles in argumentation frameworks
• The handling of loops in argumentation networks
• Stage semantics and the SCC-recursive schema for argumentation semantics
• On the acceptance of loops in argumentation frameworks
• The role of self-attacking arguments in characterizations of equivalence notions
• Splitting an Argumentation Framework
• Stepping through an Answer-Set Program
• Characterising and Explaining Inconsistency in Logic Programs
• A Game-Theoretic Measure of Argument Strength for Abstract Argumentation
• Change in Abstract Argumentation Frameworks: Adding an Argument
• Catching the Ouroboros: On debugging non-ground answer-set programs
• I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation
• Probabilistic Reasoning with Abstract Argumentation Frameworks
• On the Maximal and Average Numbers of Stable Extensions
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty

This page was built for publication: On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation