Abschlussarbeit

Abstract:

An abstract argumentation framework is a formalism that uses a directed graph of interacting arguments to represent knowledge, thus modelling an exchange of opposing viewpoints. Semantics determine the sets of simultaneously acceptable arguments, the so-called extension-sets. We analyse representatives of the class of non-admissible semantics, particularly the undisputed, strongly undisputed, weakly admissible, and weakly preferred semantics, and determine properties of the extension-sets they produce, as well as structural features of frameworks that realise extension-sets under these semantics. We describe a class of extension-sets for which we show that it is not realisable under undisputed semantics. We also identify concepts that have proven to be useful in the construction of frameworks that aim to realise given extension-sets under classical semantics and transfer them to the non-admissible case.