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).
-
dc.description.abstract
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.
en
dc.description.sponsorship
Austrian Science Funds (FWF)
-
dc.language
English
-
dc.language.iso
en
-
dc.publisher
College Publications
-
dc.relation.ispartof
Journal of Applied Logics
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.title
Abstract Dialectical Frameworks. An Overview
en
dc.type
Article
en
dc.type
Artikel
de
dc.rights.license
Urheberrechtsschutz
de
dc.rights.license
In Copyright
en
dc.contributor.affiliation
Leipzig University, Germany
-
dc.contributor.affiliation
Leipzig University, Germany
-
dc.contributor.affiliation
Leipzig University, Germany
-
dc.description.startpage
2263
-
dc.description.endpage
2317
-
dc.relation.grantno
P30168-N31
-
dc.relation.grantno
P25521
-
dc.relation.grantno
I2854
-
dc.type.category
Original Research Article
-
tuw.container.volume
4
-
tuw.container.issue
8
-
tuw.container.isbn
9781848902534
-
tuw.journal.peerreviewed
true
-
tuw.peerreviewed
true
-
tuw.version
am
-
dcterms.isPartOf.title
Journal of Applied Logics
-
tuw.publication.orgunit
E192 - Institut für Logic and Computation
-
dc.identifier.eissn
2631-9829
-
dc.identifier.libraryid
AC15244850
-
dc.description.numberOfPages
55
-
dc.identifier.urn
urn:nbn:at:at-ubtuw:3-4548
-
tuw.author.orcid
0000-0001-9001-6820
-
tuw.author.orcid
0000-0003-3882-4286
-
tuw.author.orcid
0000-0003-1594-8972
-
dc.rights.identifier
Urheberrechtsschutz
de
dc.rights.identifier
In Copyright
en
item.fulltext
with Fulltext
-
item.cerifentitytype
Publications
-
item.openairecristype
http://purl.org/coar/resource_type/c_2df8fbb1
-
item.languageiso639-1
en
-
item.openaccessfulltext
Open Access
-
item.openairetype
research article
-
item.grantfulltext
open
-
crisitem.author.dept
Leipzig University, Germany
-
crisitem.author.dept
Leipzig University, Germany
-
crisitem.author.dept
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
crisitem.author.dept
E192-02 - Forschungsbereich Databases and Artificial Intelligence