ML Anthology

Solving Advanced Argumentation Problems with Answer-Set Programming

Gerhard Brewka, Martin Diller, Georg Heissenberger, Thomas Linsbichler, Stefan Woltran
AAAI 2017 pp. 1077-1083
doi:10.1609/AAAI.V31I1.10682 /aaai/2017/brewka2017aaai-solving/

Abstract

Powerful formalisms for abstract argumentation have been proposed. Their complexity is often located beyond NP and ranges up to the third level of the polynomial hierarchy. The combined complexity of Answer-Set Programming (ASP) exactly matches this complexity when programs are restricted to predicates of bounded arity. In this paper, we exploit this coincidence and present novel efficient translations from abstract dialectical frameworks (ADFs) and GRAPPA to ASP.We also empirically compare our approach to other systems for ADF reasoning and report promising results.

PDF AAAI Semantic Scholar

Cite

Text

Brewka et al. "Solving Advanced Argumentation Problems with Answer-Set Programming." AAAI Conference on Artificial Intelligence, 2017. doi:10.1609/AAAI.V31I1.10682

Markdown

[Brewka et al. "Solving Advanced Argumentation Problems with Answer-Set Programming." AAAI Conference on Artificial Intelligence, 2017.](https://mlanthology.org/aaai/2017/brewka2017aaai-solving/) doi:10.1609/AAAI.V31I1.10682

BibTeX

@inproceedings{brewka2017aaai-solving,
  title     = {{Solving Advanced Argumentation Problems with Answer-Set Programming}},
  author    = {Brewka, Gerhard and Diller, Martin and Heissenberger, Georg and Linsbichler, Thomas and Woltran, Stefan},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2017},
  pages     = {1077-1083},
  doi       = {10.1609/AAAI.V31I1.10682},
  url       = {https://mlanthology.org/aaai/2017/brewka2017aaai-solving/}
}