Reference : A First Approach to Argumentation Label Functions
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
A First Approach to Argumentation Label Functions
Cramer, Marcos [> >]
Dauphin, Jérémie mailto [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)]
Computational Models of Argument - Proceedings of COMMA 2020, Perugia Italy, September 4-11, 2020
IOS Press
Frontiers in Artificial Intelligence and Applications
Computational Models of Argument
September 4 to 11, 2020
[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 label functions can be represented in this way while sixteen label functions cannot be represented by any argumentation framework. We show how this analysis of label 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.

File(s) associated to this reference

Fulltext file(s):

Limited access
52_Cramer.pdfAuthor preprint135.08 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.