Solving Advanced Argumentation Problems with Answer-Set Programming

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.

Authors

• Gerhard Brewka
• Martin Diller
• Georg Heissenberger
• Thomas Linsbichler
• Stefan Woltran

Keywords

No keywords are indexed for this paper.