Sciweavers

Share
AI
2015
Springer

Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory

3 years 9 months ago
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
g the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory Hannes Strass Computer Science Institute Leipzig University, Germany Johannes Peter Wallner Institute of Information Systems Vienna University of Technology, Austria dialectical frameworks (ADFs) have recently been proposed as a versatile generalization of Dung’s abstract argumentation frameworks (AFs). In this paper, we present a comprehensive analysis of the computational complexity of ADFs. Our results show that while ADFs are one level up in the polynomial hierarchy compared to AFs, there is a useful subclass of ADFs which is as complex as AFs while arguably offering more modeling capacities. As a technical vehicle, we employ the approximation fixpoint theory of Denecker, Marek and Truszczy´nski, thus showing that it is also a useful tool for complexity analysis of operator-based semantics.
Hannes Strass, Johannes Peter Wallner
Added 14 Apr 2016
Updated 14 Apr 2016
Type Journal
Year 2015
Where AI
Authors Hannes Strass, Johannes Peter Wallner
Comments (0)
books