Paper Info
Title
Complexity-sensitive decision procedures for abstract argumentation
Abstract
Abstract argumentation frameworks (AFs) provide the basis for various reasoning problems in the area of Artificial Intelligence. Efficient evaluation of AFs has thus been identified as an important research challenge. So far, implemented systems for evaluating AFs have either followed a straight-forward reduction-based approach or been limited to certain tractable classes of AFs. In this work, we present a generic approach for reasoning over AFs, based on the novel concept of complexity-sensitivity. Establishing the theoretical foundations of this approach, we derive several new complexity results for preferred, semi-stable and stage semantics which complement the current complexity landscape for abstract argumentation, providing further understanding on the sources of intractability of AF reasoning problems. The introduced generic framework exploits decision procedures for problems of lower complexity whenever possible. This allows, in particular, instantiations of the generic framework via harnessing in an iterative way current sophisticated Boolean satisfiability (SAT) solver technology for solving the considered AF reasoning problems. First experimental results show that the SAT-based instantiation of our novel approach outperforms existing systems.
Year
DOI
Venue
2012
10.1016/j.artint.2013.10.001
Artificial Intelligence
Keywords
DocType
Volume
straight-forward reduction-based approach,various reasoning problem,novel approach,complexity-sensitive decision procedure,generic approach,generic framework,current complexity landscape,af reasoning problem,new complexity result,abstract argumentation,lower complexity,algorithms
Conference
206,
Issue
ISSN
Citations 
1
0004-3702
15
PageRank 
References 
Authors
0.58
47
4
Name
Order
Citations
PageRank
Wolfgang Dvorák127124.57
Matti Järvisalo258151.00
Johannes Peter Wallner320120.62
Stefan Woltran41603121.99