Paper Info
Title
Complexity of abstract argumentation under a claim-centric view.
Abstract
Abstract argumentation frameworks have been introduced by Dung as part of an argumentation process, where arguments and conflicts are derived from a given knowledge base. It is solely this relation between arguments that is then used in order to identify acceptable sets of arguments. A final step concerns the acceptance status of particular statements by reviewing the actual contents of the acceptable arguments. Complexity analysis of abstract argumentation so far has neglected this final step and is concerned with argument names instead of their contents, i.e. their claims. As we outline in this paper, this is not only a slight deviation but can lead to different complexity results. We, therefore, give a comprehensive complexity analysis of abstract argumentation under a claim-centric view and analyse the four main decision problems under seven popular semantics. In addition, we also address the complexity of common sub-classes and introduce novel parameterisations – which exploit the nature of claims explicitly – along with fixed-parameter tractability results.
Year
DOI
Venue
2020
10.1016/j.artint.2020.103290
Artificial Intelligence
Keywords
DocType
Volume
Abstract argumentation,Computational complexity,Fixed-parameter tractability
Journal
285
Issue
ISSN
Citations 
1
0004-3702
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Wolfgang Dvorák127124.57
Stefan Woltran21603121.99