Paper Info
Title
Forbidden Sets in Argumentation Semantics.
Abstract
We consider an alternative interpretation of classical Dung argumentation framework (AF) semantics by introducing the concept of "forbidden sets". In informal terms, such sets are well-defined with respect to any extension-based semantics and reflect those subsets of argument that collectively can never form part of an acceptable solution. The forbidden set paradigm thus provides a parametric treatment of extension-based semantics. We present some general properties of forbidden set structures and describe the interaction between forbidden sets for a number of classical semantics. Finally we establish some initial complexity results in the arena of forbidden set decision problems.
Year
DOI
Venue
2016
10.3233/978-1-61499-686-6-275
Frontiers in Artificial Intelligence and Applications
Keywords
Field
DocType
abstract argumentation frameworks,extension-based semantics,computational complexity
Computer science,Natural language processing,Artificial intelligence,Argumentation semantics
Conference
Volume
ISSN
Citations 
287
0922-6389
0
PageRank 
References 
Authors
0.34
0
1
Name
Order
Citations
PageRank
Paul E. Dunne11700112.42