Reference : Argumentation Label Functions - Technical Report
Reports : External report
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/43078
Argumentation Label Functions - Technical Report
English
Cramer, Marcos [TU Dresden]
Dauphin, Jérémie mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2020
University of Luxembourg
[en] knowledge representation ; abstract argumentation ; argumentation semantics ; labelings ; flattening
[en] An important approach to abstract argumentation is the labeling-based approach, in which one makes use of labelings that assign to each argument one of three labels: in, out or und. In this paper, we address the question, which of the twenty-seven functions from the set of labels to the set of labels can be represented by an argumentation framework. We prove that in preferred, complete and grounded semantics, eleven labeling functions can be represented in this way while sixteen labeling functions cannot be represented by any argumentation framework. We show how this analysis of labeling functions can be applied to prove an impossibility result: Argumentation frameworks extended with a certain kind of weak attack relation cannot be flattened to the standard Dung argumentation frameworks.
http://hdl.handle.net/10993/43078

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
report.pdfAuthor postprint178.37 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.