The paper proceeds as follows. We first provide the background on approximation fixpoint theory, abstract dialectical frameworks and the necessary elements of ...
In this paper we studied the computational complexity of abstract dialectical frameworks using approximation fixpoint theory. We showed numerous novel results ...
Feb 1, 2023 · Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory ; Authors. Hannes Strass, Johannes ...
Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory · 69 Citations · 51 References.
Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory. July 2014; Artificial Intelligence 226(10–15). 226( ...
Nov 27, 2013 · In this paper we studied the computational complexity of abstract dialectical frameworks us- ing approximation fixpoint theory. We showed ...
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 ...
Hannes Straß, Johannes Peter Wallner. Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory.
People also ask
What is the approximation fixpoint theory?
What is the computational complexity of DFT?
Wallner. Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory. Artif. Intell., 226:34–74, 2015.
Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory ... theories in abstract dialectical frameworks ...