Paper Info
Title
Computation in Extended Argumentation Frameworks
Abstract
Extended Argumentation Frameworks (EAFs) are a recently proposed formalism that develop abstract argumentation frameworks (AFs) by allowing attacks between arguments to be attacked themselves: hence EAFs add a relationship D ⊆ X × A to the arguments (X) and attacks (A ⊆ X × X) in an AF's basic directed graph structure . This development provides a natural way to represent and reason about preferences between arguments. Studies of EAFs have thus far focussed on acceptability semantics, proof-theoretic processes, and applications. However, no detailed treatment of their practicality in computational settings has been undertaken. In this paper we address this lacuna, considering algorithmic and complexity properties specific to EAFs. We show that (as for standard AFs) the problem of determining if an argument is acceptable w.r.t. a subset of X is polynomial time decidable and, thus, determining the grounded extension and verifying admissibility are efficiently solvable. We, further, consider the status of a number of decision questions specific to the EAF formalism in the sense that these have no counterparts within AFs.
Year
DOI
Venue
2010
10.3233/978-1-60750-606-5-119
European Conference on Artificial Intelligence
Keywords
Field
DocType
complexity property,abstract argumentation framework,eaf formalism,extended argumentation frameworks,computational setting,acceptability semantics,standard afs,decision question,acceptable w,detailed treatment
Computer science,Argumentation theory,Directed graph,Decidability,Artificial intelligence,Formalism (philosophy),Time complexity,Machine learning,Semantics,Computation
Conference
Volume
ISSN
Citations 
215
0922-6389
3
PageRank 
References 
Authors
0.46
12
3
Name
Order
Citations
PageRank
Paul E. Dunne11700112.42
Sanjay Modgil292554.00
Trevor J. M. Bench-Capon31726140.23