Novel Algorithms for Abstract Dialectical Frameworks Based on Complexity Analysis of Subclasses and SAT Solving

Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes Peter Wallner, Stefan Woltran

IJCAI 2018 pp. 1905-1911

doi:10.24963/IJCAI.2018/263 /ijcai/2018/linsbichler2018ijcai-novel/

Abstract

Abstract dialectical frameworks (ADFs) constitute one of the most powerful formalisms in abstract argumentation. Their high computational complexity poses, however, certain challenges when designing efficient systems. In this paper, we tackle this issue by (i) analyzing the complexity of ADFs under structural restrictions, (ii) presenting novel algorithms which make use of these insights, and (iii) empirically evaluating a resulting implementation which relies on calls to SAT solvers.

PDF IJCAI Semantic Scholar

Cite

Text

Linsbichler et al. "Novel Algorithms for Abstract Dialectical Frameworks Based on Complexity Analysis of Subclasses and SAT Solving." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/263

Markdown

[Linsbichler et al. "Novel Algorithms for Abstract Dialectical Frameworks Based on Complexity Analysis of Subclasses and SAT Solving." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/linsbichler2018ijcai-novel/) doi:10.24963/IJCAI.2018/263

BibTeX

@inproceedings{linsbichler2018ijcai-novel,
  title     = {{Novel Algorithms for Abstract Dialectical Frameworks Based on Complexity Analysis of Subclasses and SAT Solving}},
  author    = {Linsbichler, Thomas and Maratea, Marco and Niskanen, Andreas and Wallner, Johannes Peter and Woltran, Stefan},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2018},
  pages     = {1905-1911},
  doi       = {10.24963/IJCAI.2018/263},
  url       = {https://mlanthology.org/ijcai/2018/linsbichler2018ijcai-novel/}
}