Within the last decade, abstract argumentation has emerged as a central field in Artificial
Intelligence. Besides providing a core formalism for many advanced argumentation systems …

We survey the current state of the art of general techniques, as well as specific software
systems for solving tasks in abstract argumentation frameworks, structured argumentation …

This paper presents a novel SAT-based approach for the computation of extensions in
abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its …

We present DIAMOND, an implementation of Brewka and Woltran's abstract dialectical
frameworks (ADFs). The system uses answer set programming encodings to compute …

We test different solvers dedicated to the solution of classical problems in Abstract
Argumentation, as enumeration/existence of extensions, and sceptical/credulous …

The International Competition on Computational Models of Argumentation (ICCMA) is a
successful event dedicated to advancing the state of the art of solvers in Abstract …

In this paper, we consider the weighted graph matching problem with partially disclosed
correspondences between a number of anchor nodes. Our construction exploits recently …

In this paper we test four different implementations of reasoning tools dedicated to Abstract
Argumentation Frameworks. These systems are ASPARTIX, dynPARTIX, Dung-O-Matic, and …

In Probabilistic Abstract Argumentation, arguments and attacks (nodes and edges) in a
graph instance are associated with a probability value. These probabilities can be …

The aggregation of generic items into coalitions leads to the creation of sets of homogenous
entities. In this paper we accomplish this for an input set of arguments, and the result is a …