On the resolution-based family of abstract argumentation semantics and its grounded instance
From MaRDI portal
Publication:543626
DOI10.1016/j.artint.2010.11.005zbMath1216.68255OpenAlexW1989896818WikidataQ57499571 ScholiaQ57499571MaRDI QIDQ543626
Paul E. Dunne, Massimiliano Giacomin, Pietro Baroni
Publication date: 17 June 2011
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2010.11.005
computational complexityabstract argumentation semanticsargumentation frameworkgrounded semanticssemantics evaluation criteria
Related Items (12)
On rejected arguments and implicit conflicts: the hidden power of argumentation semantics ⋮ Characteristics of multiple viewpoints in abstract argumentation ⋮ Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ Law and logic: a review from an argumentation perspective ⋮ Characterizing strong equivalence for argumentation frameworks ⋮ On the input/output behavior of argumentation frameworks ⋮ Structural Analysis of Extension-Based Argumentation Semantics with Joint Acceptability ⋮ Revealed preference in argumentation: algorithms and applications ⋮ Augmenting tractable fragments of abstract argumentation ⋮ Open Problems in Abstract Argumentation ⋮ Weighted argument systems: basic definitions, algorithms, and complexity results ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey
Uses Software
Cites Work
- Unnamed Item
- Weighted argument systems: basic definitions, algorithms, and complexity results
- AFRA: argumentation framework with recursive attacks
- Graph theoretical structures in logic programs and default theories
- Reasoning about preferences in argumentation frameworks
- Skepticism relations for comparing argumentation semantics
- Audiences in argumentation frameworks
- On the evaluation of argumentation formalisms
- On principle-based evaluation of extension-based argumentation semantics
- Computational properties of argument systems satisfying graph-theoretic constraints
- A reasoning model based on the production of acceptable arguments
- Coherence in finite argument systems.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- SCC-recursiveness: a general schema for argumentation semantics
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Hierarchical Argumentation
- Encompassing Attacks to Attacks in Abstract Argumentation Frameworks
- A Powerdomain Construction
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- Logics in Artificial Intelligence
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
This page was built for publication: On the resolution-based family of abstract argumentation semantics and its grounded instance
