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

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

„July“ befindet sich nicht in der Liste (Januar, Februar, März, April, Mai, Juni, Juli, August, September, Oktober, ...) zulässiger Werte für das Attribut „Month“.

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
Proceedings of the Fourteenth International Conference on the Principles of Knowledge Representation and Reasoning (KR), 101--110,  2014. AAAI Press
    @inproceedings{SW2014,
      author    = {Hannes Stra{\ss} and Johannes Peter Wallner},
      title     = {Analyzing the Computational Complexity of Abstract Dialectical
                   Frameworks via Approximation Fixpoint Theory},
      booktitle = {Proceedings of the Fourteenth International Conference on the
                   Principles of Knowledge Representation and Reasoning (KR)},
      publisher = {AAAI Press},
      year      = {2014},
      pages     = {101--110}
    }