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 …

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 …

A deductive argument is a pair where the first item is a set of premises, the second item is a
claim, and the premises entail the claim. This can be formalized by assuming a logical …

Abstract argumentation frameworks (AFs), originally proposed by Dung, constitute a central
formal model for the study of computational aspects of argumentation in AI. Credulous and …

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 …

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 …

We discuss the value of argumentation in reaching agreements, based on its capability for
dealing with conflicts and uncertainty. Logic-based models of argumentation have recently …

For Dungʼs model of abstract argumentation under preferred semantics, argumentation
frameworks may have several distinct preferred extensions: ie, in informal terms, sets of …

The problem of deciding the validity (QSat) of quantified Boolean formulas (QBF) is a vivid
research area in both theory and practice. In the field of parameterized algorithmics, the well …

Abstract argumentation frameworks have been introduced by Dung as part of an
argumentation process, where arguments and conflicts are derived from a given knowledge …