z-logo
open-access-imgOpen Access
On the expressive power of collective attacks
Author(s) -
Wolfgang Dvořák,
Jorge Fandinno,
Stefan Woltran
Publication year - 2019
Publication title -
argument and computation
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.38
H-Index - 20
eISSN - 1946-2166
pISSN - 1946-2174
DOI - 10.3233/aac-190457
Subject(s) - computer science , power (physics) , expressive power , programming language , physics , quantum mechanics
In this paper, we consider SETAFs due to Nielsen and Parsons, an exten-sion of Dung’s abstract argumentation frameworks that allow for collective attacks.We first provide a comprehensive analysis of the expressiveness of SETAFs un-der conflict-free, naive, stable, complete, admissible and preferred semantics. Ouranalysis shows that SETAFs are strictly more expressive than Dung AFs. Towardsa uniform characterization of SETAFs and Dung AFs we provide general resultson expressiveness which take the maximum degree of the collective attacks intoaccount. Our results show that, for eachk>0, SETAFs that allow for collectiveattacks ofk+1 arguments are more expressive than SETAFs that only allow forcollective attacks of at mostkarguments.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom