AAAI

Association for the Advancement of Artificial Intelligence

Home > Proceedings / Proceedings of the AAAI Conference on Artificial Intelligence, 31 > No. 1: Thirty-First AAAI Conference On Artificial Intelligence

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


Proceedings:

No. 1: Thirty-First AAAI Conference On Artificial Intelligence

Volume

Issue:

Proceedings of the AAAI Conference on Artificial Intelligence, 31

Track:

AAAI Technical Track: Knowledge Representation and Reasoning

Downloads:

Download PDF

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.

DOI:

10.1609/aaai.v31i1.10682


AAAI

Proceedings of the AAAI Conference on Artificial Intelligence, 31