Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory
Aus International Center for Computational Logic
Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory
Hannes StrassHannes Strass, Johannes Peter WallnerJohannes Peter Wallner
Hannes Strass, Johannes Peter Wallner
Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory
Technical Report 2, Institut für Informatik, Universität Leipzig, November 2013
Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory
Technical Report 2, Institut für Informatik, Universität Leipzig, November 2013
@techreport{SW2013,
author = {Hannes Strass and Johannes Peter Wallner},
title = {Analyzing the Computational Complexity of Abstract Dialectical
Frameworks via Approximation Fixpoint Theory},
number = {2},
institution = {Institut f{\"{u}}r Informatik, Universit{\"{a}}t Leipzig},
year = {2013},
month = {November}
}