On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs

Argumentation frameworks with collective attacks are a prominent extension of Dung’s abstract argumentation frameworks, where an attack can be drawn from a set of arguments to another argument. These frameworks are often abbreviated as SETAFs. Although SETAFs have received increasing interest recently, a thorough study on the actual behavior of collective attacks has not been carried out yet. In particular, the richer attack-structure SETAFs provide, can lead to different forms of redundant attacks, i.e., attacks that are subsumed by attacks involving less arguments. Also the notion of strong equivalence, which is fundamental in nonmonotonic formalisms to characterize equivalent replacements, has not been investigated for SETAFs so far. In this paper, we first provide a classification of different types of collective attacks, and analyze for which semantics they can be proven redundant. We do so for eleven well established abstract argumentation semantics. We then study how strong equivalence between SETAFs can be decided with respect to the considered semantics and also consider variants of strong equivalence. Our results show that removing redundant attacks in a suitable way provides direct means to characterize strong equivalence by syntactical equivalence of so-called kernels, thus generalizing well-known results on strong equivalence between Dung AFs.

[1]  Ringo Baumann,et al.  The equivalence zoo for Dung-style semantics , 2018, J. Log. Comput..

[2]  Giorgos Flouris,et al.  A comprehensive study of argumentation frameworks with sets of attacking arguments , 2019, Int. J. Approx. Reason..

[3]  Ringo Baumann,et al.  Normal and strong expansion equivalence for argumentation frameworks , 2012, Artif. Intell..

[4]  Stefan Woltran,et al.  Strong Equivalence for Argumentation Frameworks with Collective Attacks , 2019, KI.

[5]  Stefan Woltran,et al.  Evaluating SETAFs via Answer-Set Programming , 2018, SAFA@COMMA.

[6]  Thomas Linsbichler,et al.  Preprocessing Argumentation Frameworks via Replacement Patterns , 2019, JELIA.

[7]  Ringo Baumann Characterizing Equivalence Notions for Labelling-Based Semantics , 2016, KR.

[8]  Stefan Woltran,et al.  Characterizing Strong Equivalence for Argumentation Frameworks , 2010, KR.

[9]  Thomas Linsbichler,et al.  A General Notion of Equivalence for Abstract Argumentation , 2017, IJCAI.

[10]  Simon Parsons,et al.  A Generalization of Dung's Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments , 2006, ArgMAS.

[11]  Stefan Woltran,et al.  On the Expressive Power of Collective Attacks , 2018, COMMA.

[12]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[13]  Ringo Baumann,et al.  Context-free and Context-sensitive Kernels: Update and Deletion Equivalence in abstract Argumentation , 2014, ECAI.

[14]  Madalina Croitoru,et al.  Ranking-Based Semantics for Sets of Attacking Arguments , 2020, AAAI.

[15]  Miroslaw Truszczynski,et al.  Strong and uniform equivalence of nonmonotonic theories – an algebraic approach , 2006, Annals of Mathematics and Artificial Intelligence.

[16]  David Pearce,et al.  Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..

[17]  Madalina Croitoru,et al.  Toward a More Efficient Generation of Structured Argumentation Graphs , 2018, COMMA.

[18]  Paul E. Dunnea,et al.  Parametric properties of ideal semantics , 2013 .

[19]  Stefan Woltran,et al.  Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets , 2011, ECSQARU.

[20]  Stefan Woltran,et al.  Generalizations of Dung Frameworks and Their Role in Formal Argumentation , 2014, IEEE Intelligent Systems.

[21]  Stefan Woltran,et al.  Parametric Properties of Ideal Semantics , 2011, IJCAI.