Computational Aspects of cf2 and stage2 Argumentation Semantics

Computational Aspects of cf2 and stage2 Argumentation Semantics

Abstract

We consider two instantiations of the SCC-recursive schema for argumentation semantics, cf2, using maximal conflict-free sets as base semantics, and stage2, using stage extensions as base semantics. Both of them have been shown to be in general of high complexity. We provide a detailed analysis of possible tractable fragments for these semantics. Moreover we present a labeling based algorithm for computing cf2 extension, which is complexity-sensitive w.r.t. one of the tractable fragments.

Grafik Top
Authors
  • Dvořák, Wolfgang
  • Gaggl, Sarah Alice
Grafik Top
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
Fourth International Conference on Computational Models of Argument COMMA 2012
Divisions
Theory and Applications of Algorithms
Event Location
Vienna, Austria
Event Type
Conference
Event Dates
10-12 Dec 2012
Series Name
Frontiers in Artificial Intelligence and Applications
Publisher
IOS Press
Page Range
pp. 273-284
Date
2012
Export
Grafik Top