Resolution-based grounded semantics revisited.

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.

Grafik Top
Authors
  • Dvořák, Wolfgang
  • Linsbichler, Thomas
  • Oikarinen, Emilia
  • Woltran, Stefan
Grafik Top
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Full Paper in Proceedings)
Event Title
Fifth International Conference on Computational Models of Argument
Divisions
Theory and Applications of Algorithms
Subjects
Kuenstliche Intelligenz
Theoretische Informatik
Event Location
Scottish Highlands
Event Type
Conference
Event Dates
September 9th - 12th
Series Name
Frontiers in Artificial Intelligence and Applications
ISSN/ISBN
978-1-61499-435-0
Page Range
pp. 269-280
Date
September 2014
Export
Grafik Top