A mathematical treatment of defeasible reasoning and its implementation
Artificial Intelligence
Reaching agreements through argumentation: a logical model and implementation
Artificial Intelligence
Inferring from Inconsistency in Preference-Based Argumentation Frameworks
Journal of Automated Reasoning
Argumentation based decision making for autonomous agents
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Coherence and Flexibility in Dialogue Games for Argumentation
Journal of Logic and Computation
On the evaluation of argumentation formalisms
Artificial Intelligence
Computing ideal sceptical argumentation
Artificial Intelligence
Elements of Argumentation
Using arguments for making and explaining decisions
Artificial Intelligence
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Bridging the Gap between Abstract Argumentation Systems and Logic
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
On the relation between argumentation and non-monotonic coherence based entailment
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
SCC-recursiveness: a general schema for argumentation semantics
Artificial Intelligence
Arguing for decisions: a qualitative model of decision making
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Instantiating abstract argumentation with classical logic arguments: Postulates and properties
Artificial Intelligence
On warranted inference in argument trees based framework
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Generating possible intentions with constrained argumentation systems
International Journal of Approximate Reasoning
A new approach for preference-based argumentation frameworks
Annals of Mathematics and Artificial Intelligence
Some reflections on two current trends in formal argumentation
Logic Programs, Norms and Action
Stable semantics in logic-based argumentation
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
A general account of argumentation with preferences
Artificial Intelligence
Identifying the class of maxi-consistent operators in argumentation
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Dung's abstract argumentation model consists of a set of arguments and a binary relation encoding attacks among arguments. Different acceptability semantics have been defined for evaluating the arguments. What is worth noticing is that the model completely abstracts from the applications to which it can be applied. Thus, it is not clear what are the results that can be returned in a given application by each semantics. This paper answers this question. For that purpose, we start by plunging the model in a real application. That is, we assume that we have an inconsistent knowledge base (KB) containing formulas of an abstract monotonic logic. From this base, we show how to define arguments. Then, we characterize the different semantics in terms of the subsets of the KB that are returned by each extension. We show a full correspondence between maximal consistent subbases of a KB and maximal conflict-free sets of arguments. We show also that stable and preferred extensions choose randomly some consistent subbases of a base. Finally, we investigate the results of three argumentation systems that use well-known attack relations.