SCC-recursiveness: a general schema for argumentation semantics
Artificial Intelligence
On the evaluation of argumentation formalisms
Artificial Intelligence
On principle-based evaluation of extension-based argumentation semantics
Artificial Intelligence
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
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
Abstract Argumentation Scheme Frameworks
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Normal and strong expansion equivalence for argumentation frameworks
Artificial Intelligence
| Hi-index | 0.00 |
The issue of characterizing classes of argumentation frameworks where different semantics agree has been considered in the literature with main focus on the relationships between agreement and topological properties. This paper contributes to this kind of investigation from a complementary perspective, by introducing a systematic classification of agreement classes concerning a comprehensive set of argumentation semantics on the basis of properties of their sets of extensions only. In particular, it is shown that 14 distinct classes out of 120 nominal ones exist, and a complete analysis of their set-theoretical relationships is carried out.