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 …

Abstract argumentation frameworks (AFs) provide the basis for various reasoning problems
in the area of Artificial Intelligence. Efficient evaluation of AFs has thus been identified as an …

This paper tackles the fundamental questions arising when looking at argumentation
frameworks as interacting components, characterized by an Input/Output behavior, rather …

Given a semantics σ, two argumentation frameworks (AFs) F and G are said to be standard
equivalent if they possess the same extensions and strongly equivalent if, for any AF H, F …

This research note provides novel results concerning the incremental computation of the
stable and ideal argumentation semantics, by extending the division-based method …

This paper presents a meta-algorithm for the computation of preferred labellings, based on
the general recursive schema for argumentation semantics called SCC-Recursiveness. The …

Ringo Baumann abstract. This chapter is devoted to argumentation semantics which play
the flagship role in Dung's abstract argumentation theory. Almost all of them are motivated …

We address the problem of efficiently recomputing the extensions of abstract argumentation
frameworks (AFs) which are updated by adding/deleting arguments or attacks. In particular …

Incompleteness and undecidedness are pervasively present in human reasoning activities
and make the definition of the relevant computational models challenging. In this discussion …

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