Paper Info
Title
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.
Year
DOI
Venue
2012
10.3233/978-1-61499-111-3-273
Frontiers in Artificial Intelligence and Applications
Keywords
Field
DocType
Abstract Argumentation,Computational Complexity,Algorithms
Formal semantics (linguistics),Operational semantics,Computer science,Computational semantics,Denotational semantics,Theoretical computer science,Natural language processing,Artificial intelligence,Schema (psychology),Argumentation semantics,Well-founded semantics,Semantics
Conference
Volume
ISSN
Citations 
245
0922-6389
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Wolfgang Dvorák127124.57
Sarah Alice Gaggl210210.02