Abstract. The system ASPARTIX is a tool for computing acceptable extensions for a broad range of formalizations of Dung's argumentation framework and generalizations thereof. 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.
MotivationThe area of argumentation (see [1] for an excellent summary) has become one of the central issues in Artificial Intelligence (AI) within the last decade, providing a formal treatment for reasoning problems arising in a number of interesting applications fields, including Multi-Agent Systems and Law Research. In a nutshell, argumentation frameworks formalize statements together with a relation denoting rebuttals between them, such that the semantics gives an abstract handle to solve the inherent conflicts between statements by selecting admissible subsets of them. The reasoning underlying such argumentation frameworks turned out to be a very general principle capturing many other important formalisms from the areas of AI and Knowledge Representation (KR).The increasing interest in argumentation led to numerous proposals for formalizations of argumentation. These approaches differ in many aspects. First, there are several ways how "admissibility" of a subset of statements can be defined; second, the notion of rebuttal has different meanings (or even additional relationships between statements are taken into account); finally, statements are augmented with priorities, such that the semantics yields those admissible sets which contain statements of higher priority.Argumentation problems are in general intractable, thus developing dedicated algorithms for the different reasoning problems is non-trivial. Instead, a more promising approach is to use a reduction method, where the given problem is translated into another language, for which sophisticated systems already exist.The system we present in this paper follows this approach and provides solutions for reasoning problems in different types of argumentation frameworks (AFs) by means of computing the answer sets of a datalog program. To be more specific, the system is capable to compute the most important types of extensions (i.e., admissible, preferred, stable, complete, and grounded) in Dung's original AF [2], the preference-based AF [3], the value-based AF [4], and the bipolar AF [5]. Hence our system can be used to