Zur Seitenansicht


Abstract Dialectical Frameworks. An Overview
Verfasser / Verfasserin Brewka, Gerhard ; Ellmauthaler, Stefan ; Strass, Hannes ; Wallner, Johannes P. ; Woltran, Stefan In der Gemeinsamen Normdatei der DNB nachschlagen
Erschienen in
IfCoLoG Journal of Logics and their Applications, 2017, Jg. 4, H. 8, S. 2263-2317
ErschienenCollege Publications, 2017
Accepted version
This manuscript was published in IfCoLoG (ISBN 978-1-84890-253-4) and in the Handbook of Formal Argumentation (ISBN 978-1-84890-275-6).
DokumenttypAufsatz in einer Zeitschrift
Projekt-/ReportnummerAustrian Science Fund (FWF): P30168-N31
Projekt-/ReportnummerAustrian Science Fund (FWF): P25521
Projekt-/ReportnummerAustrian Science Fund (FWF): I2854
URNurn:nbn:at:at-ubtuw:3-4548 Persistent Identifier (URN)
 Das Werk ist frei verfügbar
Abstract Dialectical Frameworks. An Overview [0.66 mb]
Zusammenfassung (Englisch)

This article describes abstract dialectical frameworks, or ADFs for short. ADFs are generalizations of the widely used Dung argumentation frameworks. Whereas the latter focus on a single relation among abstract arguments, namely attack, ADFs allow arbitrary relationships among arguments to be expressed. For instance, arguments may support each other, or a group of arguments may jointly attack another one while each single member of the group is not strong enough to do so. This additional expressiveness is achieved by handling acceptance conditions for each argument explicitly. The semantics of ADFs are inspired by approximation fixpoint theory (AFT), a general algebraic theory for approximation based semantics developed by Denecker, Marek and Truszczynski. We briefly introduce AFT and discuss its role in argumentation. This puts us in a position to formally introduce ADFs and their semantics. In particular, we show how the most important Dung semantics can be generalized to ADFs. Furthermore, we illustrate the use of ADFs as semantical tool in various modelling scenarios, demonstrating how typical representations in argumentation can be equipped with precise semantics via translations to ADFs. We also present GRAPPA, a related approach where the semantics of arbitrary labelled argument graphs can be directly defined in an ADFlike manner, circumventing the need for explicit translations. Finally, we address various computational aspects of ADFs, like complexity, expressiveness and realizability, and present several implemented systems.

Das PDF-Dokument wurde 7 mal heruntergeladen.