On the resolution-based family of abstract argumentation semantics and its grounded instance

Authors:
P. Baroni;P. E. Dunne;M. Giacomin
Affiliations:
Dip. di Ingegneria dell'Informazione, University of Brescia, Via Branze 38, 25123 Brescia, Italy;Department of Computer Science, Ashton Building, University of Liverpool, Liverpool L69 7ZF, United Kingdom;Dip. di Ingegneria dell'Informazione, University of Brescia, Via Branze 38, 25123 Brescia, Italy
Venue:
Artificial Intelligence
Year:
2011

Citing 23
Cited 7

Domain theory

Handbook of logic in computer science (vol. 3)
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
Graph theoretical structures in logic programs and default theories

Theoretical Computer Science
A Reasoning Model Based on the Production of Acceptable Arguments

Annals of Mathematics and Artificial Intelligence
Coherence in finite argument systems

Artificial Intelligence
Prudent Semantics for Argumentation Frameworks

ICTAI '05 Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence
Audiences in argumentation frameworks

Artificial Intelligence
On the evaluation of argumentation formalisms

Artificial Intelligence
On principle-based evaluation of extension-based argumentation semantics

Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints

Artificial Intelligence
Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Reasoning about preferences in argumentation frameworks

Artificial Intelligence
Skepticism relations for comparing argumentation semantics

International Journal of Approximate Reasoning
Semi-Stable Semantics

Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
A dialectic procedure for sceptical, assumption-based argumentation

Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Encompassing Attacks to Attacks in Abstract Argumentation Frameworks

ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Generality and equivalence relations in default logic

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
SCC-recursiveness: a general schema for argumentation semantics

Artificial Intelligence
The computational complexity of ideal semantics

Artificial Intelligence
AFRA: Argumentation framework with recursive attacks

International Journal of Approximate Reasoning
Weighted argument systems: Basic definitions, algorithms, and complexity results

Artificial Intelligence
Symmetric argumentation frameworks

ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Evaluating argumentation semantics with respect to skepticism adequacy

ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Characterizing strong equivalence for argumentation frameworks

Artificial Intelligence
On the intertranslatability of argumentation semantics

Journal of Artificial Intelligence Research
Augmenting tractable fragments of abstract argumentation

Artificial Intelligence
On the complexity of computing the justification status of an argument

TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Parametric properties of ideal semantics

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Abstract argumentation via monadic second order logic

SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Automata for infinite argumentation structures

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a novel parametric family of semantics for abstract argumentation called resolution-based and analyzes in particular the resolution-based version of the traditional grounded semantics, showing that it features the unique property of satisfying a set of general desirable properties recently introduced in the literature. Additionally, an investigation of its computational complexity properties reveals that resolution-based grounded semantics is satisfactory also from this perspective.