We give an introductory tutorial to assumption-based argumentation (referred to as ABA)–a
form of argumentation where arguments and attacks are notions derived from primitive …

Over the last ten years, argumentation has come to be increasingly central as a core study
within Artificial Intelligence (AI). The articles forming this volume reflect a variety of important …

Wolfgang Dvorák, Paul E. Dunne abstract. In this chapter we give an overview of the core
computational problems arising in formal argumentation together with a complexity analysis …

We present two dialectic procedures for the sceptical ideal semantics for argumentation. The
first procedure is defined in terms of dispute trees, for abstract argumentation frameworks …

Assumption-Based Argumentation (ABA)[4, 3, 27, 11, 12, 20, 22] was developed, starting in
the 90s, as a computational framework to reconcile and generalise most existing …

We present a family of dialectic proof procedures for the admissibility semantics of
assumption-based argumentation. These proof procedures are defined for any conventional …

The semantic models discussed in Chapter 11 provide an important element of the formal
computational theory of abstract argumentation. Such models offer a variety of …

The changing of arguments and their attack relation is an intrinsic property of a variety of
argumentation systems. So, it is very important to efficiently figure out how the status of …

One difficulty that arises in abstract argument systems is that many natural questions
regarding argument acceptability are, in general, computationally intractable having been …

This paper is centered on the family of Dung's finite argumentation frameworks when the
attacks relation is symmetric (and nonempty and irreflexive). We show that while this family …