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

Abstract

Abstract dialectical frameworks (ADFs) have recently been proposed as a versatile gen-eralization 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 ca-pacities. 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. 1