Computing ideal sceptical argumentation

DOI10.1016/j.artint.2007.05.003zbMath1168.68564MaRDI QIDQ1028947

Phan Minh Dung, Francesca Toni, Paolo Mancarella

Publication date: 9 July 2009

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

Full work available at URL: https://doi.org/10.1016/j.artint.2007.05.003

zbMATH Keywords

abstract argumentation; assumption-based argumentation; dispute; ideal semantics; proof procedure

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

Related Items

Reasoning on the Web with Assumption-Based Argumentation, Judgment Aggregation in Abstract Dialectical Frameworks, Open Problems in Abstract Argumentation, Preferences and Assumption-Based Argumentation for Conflict-Free Normative Agents, Toward incremental computation of argumentation semantics: a decomposition-based approach, Characterizing strong equivalence for argumentation frameworks, A general framework for sound assumption-based argumentation dialogues, Postulates for logic-based argumentation systems, Instantiating abstract argumentation with classical logic arguments: postulates and properties, Dynamics of argumentation systems: a division-based method, A new approach for preference-based argumentation frameworks, Argumentation in artificial intelligence, The computational complexity of ideal semantics, Towards fixed-parameter tractable algorithms for abstract argumentation, Argumentation frameworks as constraint satisfaction problems, Complete extensions in argumentation coincide with 3-valued stable models in logic programming, Meta-argumentation modelling. I: Methodology and techniques, A logical account of formal argumentation, Abstract argumentation and explanation applied to scientific debates, A QBF-based formalization of abstract argumentation semantics, On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method, FLP answer set semantics without circular justifications for general logic programs, Conflict-Tolerant Semantics for Argumentation Frameworks, Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets, Reasoning about Exceptions to Contracts, Partial Semantics of Argumentation, Handling controversial arguments, Assumption-Based Argumentation for Selection and Composition of Services

Cites Work

• Unnamed Item
• Unnamed Item
• Two party immediate response disputes: Properties and efficiency
• An abstract, argumentation-theoretic approach to default reasoning
• On the computational complexity of assumption-based argumentation for default reasoning.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Dialectic proof procedures for assumption-based, admissible argumentation
• Logic programming and knowledge representation
• On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
• Argumentation Semantics for Defeasible Logic
• Computing argumentation in logic programming
• Computing the acceptability semantics