We describe the µ–toksia argumentation reasoning system. The system supports a range of
different reasoning tasks over both standard and dynamic abstract argumentation …

Abstract The Third International Competition on Computational Models of Argumentation
(ICCMA'19) focused on reasoning tasks in abstract argumentation frameworks. Submitted …

An Efficient Algorithm for Skeptical Preferred Acceptance in Dynamic Argumentation
Frameworks Page 1 Introduction Incremental Computation Experiments Conclusions and future …

In this article, we tackle the problem of efficiently recomputing the skeptical acceptance of
dynamic argumentation frameworks under the well-known preferred semantics. We discuss …

Dealing with controversial information is a challenging and important task for intelligent
systems. Formal argumentation enables reasoning on arguments for and against a claim to …

The third International Competition on Computational Models of Argumentation (ICCMA'19)
focuses on reasoning tasks in Abstract Argumentation. Submitted solvers are tested on a …

Abstract dialectical frameworks (ADFs) constitute one of the most powerful formalisms in
abstract argumentation. Their high computational complexity poses, however, certain …

While agent-based modelling languages naturally implement concurrency, the currently
available languages for argumentation do not allow to explicitly model this type of …

Since 2015, the International Competition on Computational Models of Argumentation
(ICCMA) has allowed to compare the different algorithms for solving some classical …

We introduce a parametrized equivalence notion for abstract argumentation that subsumes
standard and strong equivalence as corner cases. Under this notion, two argumentation …