Solving Advanced Argumentation Problems with Answer-Set Programming

Authors

  • Gerhard Brewka Universität Leipzig
  • Martin Diller Technische Universität Wien
  • Georg Heissenberger Technische Universität Wien
  • Thomas Linsbichler Technische Universität Wien
  • Stefan Woltran Technische Universität Wien

DOI:

https://doi.org/10.1609/aaai.v31i1.10682

Keywords:

argumentation, answer set programming, abstract dialectical frameworks

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.

AAAI-2017 Proceedings Cover

Downloads

Published

2017-02-12

How to Cite

Brewka, G., Diller, M., Heissenberger, G., Linsbichler, T., & Woltran, S. (2017). Solving Advanced Argumentation Problems with Answer-Set Programming. Proceedings of the AAAI Conference on Artificial Intelligence, 31(1). https://doi.org/10.1609/aaai.v31i1.10682

Issue

Vol. 31 No. 1 (2017): Thirty-First AAAI Conference on Artificial Intelligence

Section

AAAI Technical Track: Knowledge Representation and Reasoning