Improved Answer-Set Programming Encodings for Abstract Argumentation

TL;DR

This paper introduces more concise and efficient Answer-Set Programming encodings for three key abstract argumentation semantics, leveraging conditional literals in clingo, leading to better performance on benchmarks.

Contribution

The paper presents novel ASP encodings for argumentation semantics that are more succinct and outperform previous versions using conditional literals in clingo.

Findings

Encodings are more succinct than previous versions.

New encodings outperform earlier ones on standard benchmarks.

Use of conditional literals improves efficiency.

Abstract

The design of efficient solutions for abstract argumentation problems is a crucial step towards advanced argumentation systems. One of the most prominent approaches in the literature is to use Answer-Set Programming (ASP) for this endeavor. In this paper, we present new encodings for three prominent argumentation semantics using the concept of conditional literals in disjunctions as provided by the ASP-system clingo. Our new encodings are not only more succinct than previous versions, but also outperform them on standard benchmarks.