Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory

From International Center for Computational Logic
Toggle side column

Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory

Hannes StraßHannes Straß,  Johannes Peter WallnerJohannes Peter Wallner
Hannes Straß, 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
    @techreport{SW2013,
      author      = {Hannes Stra{\ss} 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}
    }