Computing Preferred Extensions for Argumentation Systems with Sets of Attacking Arguments

Authors:
Søren Holbech Nielsen;Simon Parsons
Affiliations:
Department of Computer Science, Aalborg University, Aalborg, Denmark;Department of Computer and Information Science, Brooklyn College, City University of New York, Brooklyn, 11210 NY, USA
Venue:
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Year:
2006

Citing 10
Cited 5

Argumentative logics: reasoning with classically inconsistent information

Data & Knowledge Engineering
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
An abstract, argumentation-theoretic approach to default reasoning

Artificial Intelligence
Preferred Arguments are Harder to Compute than Stable Extension

IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Symbolic Evidence, Arguments, Supports and Valuation Networks

ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Preferred Extensions of Argumentation Frameworks: Query Answering and Computation

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Modeling Dialogues Using Argumentation

ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Argument-based applications to knowledge engineering

The Knowledge Engineering Review
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
On the acceptability of arguments in preference-based argumentation

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence

Argumentation in artificial intelligence

Artificial Intelligence
On the merging of Dung's argumentation systems

Artificial Intelligence
An application of formal argumentation: Fusing Bayesian networks in multi-agent systems

Artificial Intelligence
An Application of Formal Argumentation: Fusing Bayes Nets in MAS

Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Automata for infinite argumentation structures

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments, but in a recent paper we adapted it to support such attacks, and proved that this adapted framework enjoyed the same formal properties as that of Dung. One problem posed by Dung's original framework, which was neglected for some time, is how to compute preferred extensions of the argumentation systems. However, in 2001, in a paper by Doutre and Mengin, a procedure was given for enumerating preferred extensions for these systems. In this paper we propose a method for enumerating preferred extensions of the potentially more complex systems, where joint attacks are allowed. The method is inspired by the one given by Doutre and Mengin.