Paper Info
Title
Resolution-Based Grounded Semantics Revisited.
Abstract
The resolution-based grounded semantics constitutes one of the most interesting approaches for the evaluation of abstract argumentation frameworks. This particular semantics satisfies a large number of desired properties, among them all properties proposed by Baroni and Giacomin. In recent years, the analysis of argumentation semantics has been extended by further topics, among them characterizations for equivalence notions, intertranslatability issues, and expressibility in terms of signatures (all possible sets of extensions a semantics is capable to express). In this line of research, resolution-based grounded semantics has been neglected so far. We close this gap here, compare the expressibility of resolution-based grounded semantics with other prominent semantics, provide a characterization for strong equivalence and complement existing complexity results.
Year
DOI
Venue
2014
10.3233/978-1-61499-436-7-269
Frontiers in Artificial Intelligence and Applications
Keywords
Field
DocType
abstract argumentation,resolution-based grounded semantics,complexity,intertranslatability,signatures,strong equivalence
Programming language,Computer science,Argumentation theory,Equivalence (measure theory),Natural language processing,Artificial intelligence,Argumentation semantics,Semantics
Conference
Volume
ISSN
Citations 
266
0922-6389
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Wolfgang Dvorák127124.57
Thomas Linsbichler2449.17
Emilia Oikarinen325018.60
Stefan Woltran41603121.99