Guest Column: Complexity of Verication in Abstract Argumentation Frameworks

Abstract

Abstract argumentation frameworks introduced by Dung [Dun95] are a formal way of representing discussions de ned through arguments and a binary attack relation between them. In dynamic settings there is a need to allow for uncertainty in such argumentation frameworks, hence attack-incomplete and argument-incomplete argumentation frameworks are considered as well. Different semantics are de ned in order to identify a set of acceptable arguments, and the verification problem asks whether some given set is an extension for a given semantics. This survey gives an overview of the complexity of the verification problem for different semantics in complete and incomplete argumentation frameworks.