Paper Info
Title
On The Expressive Power Of Collective Attacks
Abstract
In this paper, we consider argumentation frameworks with sets of attacking arguments (SETAFs) due to Nielsen and Parsons, an extension of Dung's abstract argumentation frameworks that allow for collective attacks. We first provide a comprehensive analysis of the expressiveness of SETAFs under conflict-free, naive, stable, complete, admissible, preferred, semi-stable, and stage semantics. Our analysis shows that SETAFs are strictly more expressive than Dung AFs. Towards a uniform characterization of SETAFs and Dung AFs we provide general results on expressiveness which take the maximum degree of the collective attacks into account. Our results show that, for each k > 0, SETAFs that allow for collective attacks of k + 1 arguments are more expressive than SETAFs that only allow for collective attacks of at most k arguments.
Year
DOI
Venue
2018
10.3233/AAC-190457
ARGUMENT & COMPUTATION
Keywords
Field
DocType
Abstract argumentation, SETAF, collective attacks, expressiveness
Programming language,Argumentation theory,Artificial intelligence,Natural language processing,Degree (graph theory),Expressive power,Semantics,Mathematics,Expressivity
Conference
Volume
Issue
ISSN
10
2
1946-2166
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Wolfgang Dvorák127124.57
Jorge Fandinno21010.29
Stefan Woltran31603121.99