Talks and Poster Presentations (with Proceedings-Entry):
H. Strass, J. P. Wallner:
"Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory";
Talk: Principles of Knowledge Representation and Reasoning (KR),
- 07-24-2014; in: "Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference",
C. Baral, G. De Giacomo, T. Eiter (ed.);
Abstract 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ński, thus showing that it is also a useful tool for complexity analysis of operator-based semantics.
Created from the Publication Database of the Vienna University of Technology.