{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:45:10Z","timestamp":1777434310843,"version":"3.51.4"},"reference-count":33,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T00:00:00Z","timestamp":1597276800000},"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":[[2021,2,15]]},"abstract":"<jats:p>In this work, we question the ability of existing ranking-based semantics to capture persuasion settings, emphasising in particular the phenomena of procatalepsis (the fact that it is often efficient to anticipate the counter-arguments of the audience) and of fading (the fact that long lines of argumentation become ineffective). Some widely accepted principles of ranking-based semantics (like Void Precedence) are incompatible with a faithful treatment of these phenomena, which means that no existing ranking-based semantics can capture these two principles together. This motivates us to introduce a new parametrized ranking-based semantics based on the notion of propagation which extends the existing propagation semantics (In Proceedings of the 6th International Conference on Computational Models of Argument (COMMA\u201916) ( 2016 ) 139\u2013150) by adding an additional parameter allowing us to gradually decrease the impact of arguments when the length of the path between two arguments increases. We show that this parameter gives the possibility of choosing if one wants to satisfy the property Void Precedence or not (and then capture procatalepsis) and to control the scope of the impact of the arguments (and then to capture fading principle). We also propose an experiment to show that the new semantics remains stable when this parameter varies and an axiomatic evaluation to compare it with existing ranking-based semantics in the literature.<\/jats:p>","DOI":"10.3233\/aac-200905","type":"journal-article","created":{"date-parts":[[2020,8,14]],"date-time":"2020-08-14T13:13:04Z","timestamp":1597410784000},"page":"49-85","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":12,"title":["A parametrized ranking-based semantics compatible with persuasion principles"],"prefix":"10.1177","volume":"12","author":[{"given":"Elise","family":"Bonzon","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Paris, LIPADE, F-75006 Paris, France. E-mail:\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Delobelle","sequence":"additional","affiliation":[{"name":"Universit\u00e9 C\u00f4te d\u2019Azur, Inria, CNRS, I3S, Sophia-Antipolis, France. E-mail:\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Konieczny","sequence":"additional","affiliation":[{"name":"CRIL, CNRS \u2013 Universit\u00e9 d\u2019Artois, France. E-mail:\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Maudet","sequence":"additional","affiliation":[{"name":"Sorbonne Universit\u00e9, UPMC Univ Paris 06, CNRS - LIP6, UMR 7606, Paris, France. E-mail:\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2020,8,13]]},"reference":[{"key":"ref001","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/874"},{"key":"ref002","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40381-1_11"},{"key":"ref003","unstructured":"L.\u00a0Amgoud, J.\u00a0Ben-Naim, D.\u00a0Doder and S.\u00a0Vesic, Ranking arguments with compensation-based semantics, in: Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201916), 2016, pp.\u00a012\u201321."},{"key":"ref004","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2018.11.019"},{"key":"ref005","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2017.00133"},{"key":"ref006","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00071-6"},{"key":"ref007","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262026437.001.0001"},{"key":"ref008","unstructured":"E.\u00a0Bonzon, J.\u00a0Delobelle, S.\u00a0Konieczny and N.\u00a0Maudet, Argumentation ranking semantics based on propagation, in: Proceedings of the 6th International Conference on Computational Models of Argument (COMMA\u201916), 2016, pp.\u00a0139\u2013150."},{"key":"ref009","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10116"},{"key":"ref010","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67582-4_17"},{"key":"ref011","unstructured":"E.\u00a0Bonzon, J.\u00a0Delobelle, S.\u00a0Konieczny and N.\u00a0Maudet, Combining extension-based semantics and ranking-based semantics for abstract argumentation, in: Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201918), 2018, pp.\u00a0118\u2013127."},{"key":"ref012","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/766"},{"key":"ref013","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1411"},{"key":"ref014","unstructured":"C.\u00a0da\u00a0Costa Pereira, A.\u00a0Tettamanzi and S.\u00a0Villata, Changing one\u2019s mind: Erase or rewind? in: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI\u201911), 2011, pp.\u00a0164\u2013171."},{"key":"ref015","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"ref016","unstructured":"D.\u00a0Grossi and S.\u00a0Modgil, On the graded acceptability of arguments, in: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI\u201915), 2015, pp.\u00a0868\u2013874."},{"key":"ref017","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.05.001"},{"key":"ref018","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11558-0_4"},{"key":"ref019","doi-asserted-by":"publisher","DOI":"10.3233\/AAC-170032"},{"key":"ref020","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61581-3_5"},{"key":"ref021","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/30.1-2.81"},{"key":"ref022","unstructured":"J.\u00a0Leite and J.\u00a0Martins, Social abstract argumentation, in: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI\u201911), 2011, pp.\u00a02287\u20132292."},{"key":"ref023","doi-asserted-by":"publisher","DOI":"10.1145\/2850417"},{"key":"ref024","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87803-2_24"},{"key":"ref025","unstructured":"H.\u00a0Prakken and M.D.\u00a0Winter, Abstraction in argumentation: Necessary but dangerous, in: Proceedings of the 7th International Conference on Computational Models of Argument (COMMA\u201918), 2018, pp.\u00a085\u201396."},{"key":"ref026","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2015.46"},{"key":"ref027","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12096-6_26"},{"key":"ref028","unstructured":"F.\u00a0Pu, J.\u00a0Luo, Y.\u00a0Zhang and G.\u00a0Luo, Attacker and defender counting approach for abstract argumentation, in: Proceedings of the 37th Annual Meeting of the Cognitive Science Society (CogSci\u201915), 2015, pp.\u00a01913\u20131918."},{"key":"ref029","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0"},{"key":"ref030","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883081"},{"key":"ref031","unstructured":"M.\u00a0Thimm and G.\u00a0Kern-Isberner, On controversiality of arguments and stratified labelings, in: Proceedings of the 5th International Conference on Computational Models of Argument (COMMA\u201914), 2014, pp.\u00a0413\u2013420."},{"key":"ref032","unstructured":"M.\u00a0Thimm and S.\u00a0Villata,\n                      First International Competition on Computational Models of Argumentation (ICCMA\u201915)\n                      , 2015, see http:\/\/argumentationcompetition.org\/2015\/."},{"key":"ref033","doi-asserted-by":"publisher","DOI":"10.1075\/cvs.5"}],"container-title":["Argument &amp; Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-200905","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/AAC-200905","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-200905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:53:15Z","timestamp":1777377195000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/AAC-200905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,13]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2,15]]}},"alternative-id":["10.3233\/AAC-200905"],"URL":"https:\/\/doi.org\/10.3233\/aac-200905","relation":{},"ISSN":["1946-2166","1946-2174"],"issn-type":[{"value":"1946-2166","type":"print"},{"value":"1946-2174","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,13]]}}}