Computational Aspects of cf2 and stage2 Argumentation Semantics

Wolfgang Dvorak, Sarah Alice Gaggl

Veröffentlichungen: Beitrag in BuchBeitrag in Konferenzband

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.
OriginalspracheEnglisch
TitelCOMMA
UntertitelComputational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012
Redakteure*innenBart Verheij, Stefan Szeider, Stefan Woltran
ErscheinungsortAmsterdam
Herausgeber (Verlag)IOS Press
Seiten273-284
Seitenumfang12
DOIs
PublikationsstatusVeröffentlicht - 2012

Publikationsreihe

ReiheFrontiers in Artificial Intelligence and Applications
ISSN0922-6389

ÖFOS 2012

  • 1020 Informatik

Zitationsweisen