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

Aus International Center for Computational Logic
Version vom 26. Oktober 2021, 13:46 Uhr von Hannes Straß (Diskussion | Beiträge)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

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
Artificial Intelligence, 226:34--74, 2015
    @article{SW2015,
      author  = {Hannes Stra{\ss} and Johannes Peter Wallner},
      title   = {Analyzing the Computational Complexity of Abstract Dialectical
                 Frameworks via Approximation Fixpoint Theory},
      journal = {Artificial Intelligence},
      volume  = {226},
      year    = {2015},
      pages   = {34--74},
      doi     = {10.1016/j.artint.2015.05.003}
    }