{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:43:01Z","timestamp":1777434181479,"version":"3.51.4"},"reference-count":27,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Argument &amp; Computation"],"published-print":{"date-parts":[[2019,9,2]]},"abstract":"<jats:p>In this paper, we consider argumentation frameworks with sets of attacking arguments (SETAFs) due to Nielsen and Parsons, an extension of Dung\u2019s 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 [Formula: see text], SETAFs that allow for collective attacks of [Formula: see text] arguments are more expressive than SETAFs that only allow for collective attacks of at most k arguments.<\/jats:p>","DOI":"10.3233\/aac-190457","type":"journal-article","created":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T12:16:19Z","timestamp":1564748179000},"page":"191-230","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":9,"title":["On the expressive power of collective attacks"],"prefix":"10.1177","volume":"10","author":[{"given":"Wolfgang","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[{"name":"Institute of Logic and Computation, TU Wien, Austria. E-mails:\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Fandinno","sequence":"additional","affiliation":[{"name":"IRIT, Universit\u00e9 de Toulouse, CNRS, Toulouse, France. E-mail:\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[{"name":"Institute of Logic and Computation, TU Wien, Austria. E-mails:\u00a0,\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2019,9,1]]},"reference":[{"key":"ref001","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.09.004"},{"key":"ref002","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/13.3.405"},{"key":"ref003","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2013.122"},{"key":"ref004","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exr033"},{"key":"ref005","unstructured":"M.\u00a0Diller, A.\u00a0Keshavarzi Zafarghandi, T.\u00a0Linsbichler and S.\u00a0Woltran, Investigating subclasses of abstract dialectical frameworks, in: Computational Models of Argument \u2013 Proceedings of COMMA 2018, Warsaw, Poland, 12\u201314 September 2018, S.\u00a0Modgil, K.\u00a0Budzynska and J.\u00a0Lawrence, eds, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0305, IOS Press, 2018, pp.\u00a061\u201372, http:\/\/ebooks.iospress.nl\/volume\/computational-models-of-argument-proceedings-of-comma-2018. ISBN 978-1-61499-905-8."},{"key":"ref006","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"ref007","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.07.006"},{"key":"ref008","unstructured":"P.E.\u00a0Dunne, C.\u00a0Spanring, T.\u00a0Linsbichler and S.\u00a0Woltran, Investigating the relationship between argumentation semantics via signatures, in: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9\u201315 July 2016, S.\u00a0Kambhampati, ed. IJCAI\/AAAI Press, 2016, pp.\u00a01051\u20131057, http:\/\/www.ijcai.org\/Abstract\/16\/153. ISBN 978-1-57735-770-4."},{"key":"ref009","unstructured":"W.\u00a0Dvo\u0159\u00e1k and P.E.\u00a0Dunne, Computational problems in formal argumentation and their complexity, in: Handbook of Formal Argumentation, P.\u00a0Baroni, D.\u00a0Gabbay, M.\u00a0Giacomin and L.\u00a0van der Torre, eds, College Publications, 2018, pp.\u00a02557\u20132622, Chap. 14. also appears in\n                      IfCoLog Journal of Logics and their Applications\n                      4\n                      (8): 2557\u20132622."},{"key":"ref010","unstructured":"W.\u00a0Dvo\u0159\u00e1k, J.\u00a0Fandinno and S.\u00a0Woltran, On the expressive power of collective attacks, in: Computational Models of Argument \u2013 Proceedings of COMMA 2018, Warsaw, Poland, 12\u201314 September 2018, S.\u00a0Modgil, K.\u00a0Budzynska and J.\u00a0Lawrence, eds, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0305, IOS Press, 2018, pp.\u00a049\u201360. ISBN 978-1-61499-905-8. doi:10.3233\/978-1-61499-906-5-49."},{"key":"ref011","unstructured":"W.\u00a0Dvo\u0159\u00e1k, A.\u00a0Gre\u00dfler and S.\u00a0Woltran, Evaluating SETAFs via answer-set programming, in: Proceedings of the Second International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2018) Co-Located with the 7th International Conference on Computational Models of Argument (COMMA 2018), Warsaw, Poland, September 11, 2018, M.\u00a0Thimm, F.\u00a0Cerutti and M.\u00a0Vallati, eds, CEUR Workshop Proceedings, Vol.\u00a02171, CEUR-WS.org, 2018, pp.\u00a010\u201321, http:\/\/ceur-ws.org\/Vol-2171\/paper_2.pdf."},{"key":"ref012","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3318"},{"key":"ref013","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2019.03.006"},{"key":"ref014","unstructured":"T.\u00a0Linsbichler, Characteristics of Multiple Viewpoints in Abstract Argumentation under Complete Semantics, Technical Report, DBAI-TR\u20132018-113, Technische Universit\u00e4t Wien, 2018, http:\/\/www.dbai.tuwien.ac.at\/research\/report\/dbai-tr-2018-113.pdf."},{"key":"ref015","unstructured":"T.\u00a0Linsbichler, J.\u00a0P\u00fchrer and H.\u00a0Strass, A uniform account of realizability in abstract argumentation, in: Proc. ECAI, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0285, IOS Press, 2016, pp.\u00a0252\u2013260. ISBN 978-1-61499-671-2. doi:10.3233\/978-1-61499-672-9-252."},{"key":"ref016","doi-asserted-by":"crossref","unstructured":"S.H.\u00a0Nielsen and S.\u00a0Parsons, A generalization of Dung\u2019s abstract framework for argumentation: Arguing with sets of attacking arguments, in: Proc. ArgMAS, Lecture Notes in Computer Science, Vol.\u00a04766, Springer, 2006, pp.\u00a054\u201373.","DOI":"10.1007\/978-3-540-75526-5_4"},{"key":"ref017","unstructured":"S.\u00a0Polberg, Developing the abstract dialectical framework, PhD thesis, TU Wien, Institute of Information Systems, 2017, http:\/\/katalog.ub.tuwien.ac.at\/AC13773888."},{"key":"ref018","unstructured":"J.\u00a0P\u00fchrer, Realizability of three-valued semantics for abstract dialectical frameworks, in: Proc. IJCAI, AAAI Press, 2015, pp.\u00a03171\u20133177."},{"key":"ref019","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4879"},{"key":"ref020","unstructured":"H.\u00a0Strass, The relative expressiveness of abstract argumentation and logic programming, in: Proc. AAAI, AAAI Press, 2015, pp.\u00a01625\u20131631, http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI15\/paper\/view\/9352. ISBN 978-1-57735-698-1."},{"key":"ref021","unstructured":"B.\u00a0Verheij, Two approaches to dialectical argumentation: Admissible sets and argumentation stages, in: Proceedings of the 8th Dutch Conference on Artificial Intelligence (NAIC\u201996), J.J.C.\u00a0Meyer and L.C.\u00a0van der Gaag, eds, 1996, pp.\u00a0357\u2013368."},{"key":"ref022","unstructured":"B.\u00a0Verheij, Rules, Reasons, Arguments. Formal studies of argumentation and defeat, PhD thesis, Universiteit Maastricht, 1996, https:\/\/cris.maastrichtuniversity.nl\/portal\/files\/1736888\/guid-f8972ab2-c68f-4291-b229-d5207cd83320-ASSET1.0."},{"key":"ref023","unstructured":"B.\u00a0Verheij, Argue! \u2013 an implemented system for computer-mediated defeasible argumentation, in: Proceedings of the Tenth Netherlands\/Belgium Conference on Artificial Intelligence (NAIC \u201998), H.L.\u00a0Poutr\u00e9 and H.\u00a0van den Herik, eds, CWI, Amsterdam, Netherlands, 1998, pp.\u00a057\u201366."},{"key":"ref024","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/13.3.319"},{"key":"ref025","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(03)00107-3"},{"key":"ref026","unstructured":"J.P.\u00a0Wallner, Structural constraints for dynamic operators in abstract argumentation, in: Computational Models of Argument \u2013 Proceedings of COMMA 2018, Warsaw, Poland, 12\u201314 September 2018, S.\u00a0Modgil, K.\u00a0Budzynska and J.\u00a0Lawrence, eds, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0305, IOS Press, 2018, pp.\u00a073\u201384. ISBN 978-1-61499-905-8. doi:10.3233\/978-1-61499-906-5-73."},{"key":"ref027","unstructured":"B.\u00a0Yun, S.\u00a0Vesic and M.\u00a0Croitoru, Toward a more efficient generation of structured argumentation graphs, in: Computational Models of Argument \u2013 Proceedings of COMMA 2018, Warsaw, Poland, 12\u201314 September 2018, S.\u00a0Modgil, K.\u00a0Budzynska and J.\u00a0Lawrence, eds, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0305, IOS Press, 2018, pp.\u00a0205\u2013212. ISBN 978-1-61499-905-8. doi:10.3233\/978-1-61499-906-5-205."}],"container-title":["Argument &amp; Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-190457","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/AAC-190457","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-190457","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:53:09Z","timestamp":1777377189000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/AAC-190457"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,1]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,9,2]]}},"alternative-id":["10.3233\/AAC-190457"],"URL":"https:\/\/doi.org\/10.3233\/aac-190457","relation":{},"ISSN":["1946-2166","1946-2174"],"issn-type":[{"value":"1946-2166","type":"print"},{"value":"1946-2174","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,1]]}}}