Sarah Alice Gaggl

TL;DR: This work presents ASP-encodings for problems associated to abstract argumentation frameworks (AFs) and generalisations thereof and illustrates the functioning of this approach, which is underlying a new argumentation system called ASPARTIX in detail and shows its adequacy in terms of computational complexity.

TL;DR: This survey gives an overview on different methods for solving reasoning problems in abstract argumentation and compare their particular features, and highlights available state-of-the-art systems for Abstract argumentation, which put these methods to practice.

TL;DR: The value of argumentation in reaching agreements is discussed, based on its capability for dealing with conflicts and uncertainty, and a number of open challenges are identified if this potential is to be realised.

TL;DR: The system ASPARTIX relies on a fixed disjunctive datalog program which takes an instance of an argumentation framework as input, and uses the answer-set solver DLV for computing the type of extension specified by the user.

TL;DR: The original encodings (for the argumentation semantics based on preferred, semi-stable, and respectively, stage extensions) are compared with new metaspEncodings for the recently introduced resolution-based grounded semantics and results indicate that the metasp approach works well in those cases where the complexity of the encoded problem is adequately mirrored within the meetasp approach.