Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory
From International Center for Computational Logic
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, July 2014. AAAI Press
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, July 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},
month = {July},
pages = {101--110}
}