{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T06:59:53Z","timestamp":1784185193421,"version":"3.55.0"},"reference-count":37,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T00:00:00Z","timestamp":1602460800000},"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":[[2020,11,10]]},"abstract":"<jats:p>In this paper we ask whether approximation for abstract argumentation is useful in practice, and in particular whether reasoning with grounded semantics\u00a0\u2013 which has polynomial runtime\u00a0\u2013 is already an approximation approach sufficient for several practical purposes. While it is clear from theoretical results that reasoning with grounded semantics is different from, for example, skeptical reasoning with preferred semantics, we investigate how significant this difference is in actual argumentation frameworks. As it turns out, in many graphs models, reasoning with grounded semantics actually approximates reasoning with other semantics almost perfectly. An algorithm for grounded reasoning is thus a conceptually simple approximation algorithm that not only does not need a learning phase\u00a0\u2013 like recent approaches\u00a0\u2013 but also approximates well\u00a0\u2013 in practice\u00a0\u2013 several decision problems associated to other semantics.<\/jats:p>","DOI":"10.3233\/aac-200907","type":"journal-article","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T12:08:38Z","timestamp":1602590918000},"page":"269-304","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":11,"title":["An experimental analysis on the similarity of argumentation semantics"],"prefix":"10.1177","volume":"11","author":[{"given":"Federico","family":"Cerutti","sequence":"first","affiliation":[{"name":"Department of Information Engineering, University of Brescia, Brescia, Italy. E-mail:\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Thimm","sequence":"additional","affiliation":[{"name":"Institute for Web Science and Technologies, University of Koblenz-Landau, Germany. E-mail:\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mauro","family":"Vallati","sequence":"additional","affiliation":[{"name":"School of Computing and Engineering, University of Huddersfield, Huddersfield, United Kingdom. E-mail:\u00a0"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2020,10,12]]},"reference":[{"key":"ref001","doi-asserted-by":"crossref","unstructured":"A.\u00a0Barabasi and R.\u00a0Albert, Emergence of scaling in random networks, Science 286(5439) (1999), 11.","DOI":"10.1126\/science.286.5439.509"},{"key":"ref002","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888911000166"},{"key":"ref003","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.05.002"},{"key":"ref004","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2009.02.006"},{"key":"ref005","unstructured":"M.\u00a0Caminada, Semi-stable semantics, in: Proceedings of COMMA 2006, 2006, pp.\u00a0121\u2013130."},{"key":"ref006","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-009-9218-x"},{"key":"ref007","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-61499-436-7-221"},{"key":"ref008","unstructured":"F.\u00a0Cerutti, M.\u00a0Giacomin and M.\u00a0Vallati, Generating structured argumentation frameworks: AFBenchGen2., in: COMMA, P.\u00a0Baroni, T.F.\u00a0Gordon, T.\u00a0Scheffler and M.\u00a0Stede, eds, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0287, IOS Press, 2016, pp.\u00a0467\u2013468, http:\/\/dblp.uni-trier.de\/db\/conf\/comma\/comma2016.html#CeruttiGV16. ISBN 978-1-61499-686-6."},{"key":"ref009","unstructured":"F.\u00a0Cerutti, N.\u00a0Oren, H.\u00a0Strass, M.\u00a0Thimm and M.\u00a0Vallati, A\u00a0benchmark framework for a computational argumentation competition, in: Proc. of COMMA, 2014, pp.\u00a0459\u2013460."},{"key":"ref010","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-61499-686-6-207"},{"key":"ref011","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2017.10.002"},{"issue":"1","key":"ref012","first-page":"43","volume":"8","author":"Choi S.-S.","year":"2010","journal-title":"Journal of Systemics, Cybernetics and Informatics"},{"key":"ref013","doi-asserted-by":"crossref","unstructured":"D.\u00a0Craandijk and F.\u00a0Bex, Deep learning for abstract argumentation semantics, in: Proceedings of the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI-PRICAI20), 2020.","DOI":"10.24963\/ijcai.2020\/231"},{"key":"ref014","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.12.004"},{"key":"ref015","doi-asserted-by":"crossref","unstructured":"M.M.\u00a0Deza and E.\u00a0Deza, Encyclopedia of Distances, Springer, Berlin, Heidelberg, 2014, https:\/\/books.google.it\/books?id=q_7FBAAAQBAJ. ISBN 9783662443422.","DOI":"10.1007\/978-3-662-44342-2"},{"key":"ref016","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01713-2_16"},{"key":"ref017","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"ref018","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.05.003"},{"key":"ref019","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, Chapter\u00a014."},{"key":"ref020","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"ref021","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815867"},{"key":"ref022","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"ref023","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.10.037"},{"key":"ref024","first-page":"547","volume":"37","author":"Jaccard P.","year":"1901","journal-title":"Bulletin de la Societe Vaudoise des Sciences Naturelles"},{"key":"ref025","unstructured":"T.N.\u00a0Kipf and M.\u00a0Welling, Semi-supervised classification with graph convolutional networks, arXiv:1609.02907 [cs, stat], 2017."},{"key":"ref026","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-35514-2_3"},{"key":"ref027","doi-asserted-by":"publisher","DOI":"10.1038\/234034a0"},{"key":"ref028","unstructured":"L.\u00a0Malmqvist, T.\u00a0Yuan, P.\u00a0Nigthingale and S.\u00a0Manandhar, Determining the acceptability of abstract arguments with graph convolutional networks, in: Proceedings of the 3rd International Workshop on Systems and Algorithms for Formal Argumentation (SAFA\u201920), 2020."},{"key":"ref029","doi-asserted-by":"publisher","DOI":"10.4064\/cm-6-1-319-327"},{"key":"ref030","doi-asserted-by":"publisher","DOI":"10.1080\/19462166.2013.869766"},{"key":"ref031","doi-asserted-by":"publisher","DOI":"10.1126\/science.132.3434.1115"},{"key":"ref032","unstructured":"A.\u00a0Toniolo, T.J.\u00a0Norman, A.\u00a0Etuk, F.\u00a0Cerutti, R.W.\u00a0Ouyang, M.\u00a0Srivastava, N.\u00a0Oren, T.\u00a0Dropps, J.A.\u00a0Allen and P.\u00a0Sullivan, Agent support to reasoning with different types of evidence in intelligence analysis, in: Proc. of AAMAS 2015, 2015, pp.\u00a0781\u2013789."},{"key":"ref033","doi-asserted-by":"publisher","DOI":"10.3233\/978-1-61499-419-0-1117"},{"key":"ref034","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63004-5_25"},{"key":"ref035","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888918000036"},{"key":"ref036","unstructured":"B.\u00a0Verheij, Two approaches to dialectical argumentation:admissible sets and argumentation stages, in: Proceedings of the Eighth Dutch Conference on Artificial Intelligence (NAIC\u201996), Utrecht, NL, J.J.Ch.\u00a0Meyer and L.C.\u00a0van der Gaag, eds, 1996, pp.\u00a0357\u2013368."},{"key":"ref037","doi-asserted-by":"publisher","DOI":"10.1038\/30918"}],"container-title":["Argument &amp; Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-200907","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/AAC-200907","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-200907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:53:13Z","timestamp":1777377193000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/AAC-200907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,12]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,11,10]]}},"alternative-id":["10.3233\/AAC-200907"],"URL":"https:\/\/doi.org\/10.3233\/aac-200907","relation":{},"ISSN":["1946-2166","1946-2174"],"issn-type":[{"value":"1946-2166","type":"print"},{"value":"1946-2174","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,12]]}}}