{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:43:50Z","timestamp":1777434230760,"version":"3.51.4"},"reference-count":27,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T00:00:00Z","timestamp":1565222400000},"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,1,29]]},"abstract":"<jats:p>In the current paper, we re-examine the concept of strong admissibility, as was originally introduced by Baroni and Giacomin. We examine the formal properties of strong admissibility, both in its extension-based and in its labelling-based form, and analyse the computational complexity of the relevant decision problems. Moreover, we show that strong admissibility plays a vital role in discussion-based proof procedures for grounded semantics. In particular it allows one to compare the performance of alternative dialectical proof procedures for grounded semantics, and obtain some remarkable differences between the Standard Grounded Game and the Grounded Discussion Game.<\/jats:p>","DOI":"10.3233\/aac-190463","type":"journal-article","created":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T11:29:02Z","timestamp":1565350142000},"page":"277-300","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":17,"title":["Strong admissibility revisited: Theory\u00a0and\u00a0applications"],"prefix":"10.1177","volume":"10","author":[{"given":"Martin","family":"Caminada","sequence":"first","affiliation":[{"name":"Cardiff University, Queen\u2019s Buildings, 5 The Parade, Cardiff CF24 2LQ, United Kingdom. E-mail:\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Dunne","sequence":"additional","affiliation":[{"name":"University of Liverpool, Ashton Building, Liverpool L69 7ZF, United Kingdom. E-mail:\u00a0"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2019,8,8]]},"reference":[{"key":"ref001","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888911000166"},{"key":"ref002","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.02.003"},{"key":"ref003","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.04.004"},{"key":"ref004","unstructured":"R.\u00a0Baumann, T.\u00a0Linsbichler and S.\u00a0Woltran, Verifiability of argumentation semantics, in: Computational Models of Argument; Proceedings of COMMA 2016, P.\u00a0Baroni, T.F.\u00a0Gordon, T.\u00a0Scheffler and M.\u00a0Stede, eds, 2016, pp.\u00a083\u201394."},{"key":"ref005","doi-asserted-by":"crossref","unstructured":"T.J.M.\u00a0Bench-Capon, Dilemmas and paradoxes: Cycles in argumentation frameworks,\n                      Journal of Logic and Computation\n                      (2014).","DOI":"10.1093\/logcom\/exu011"},{"key":"ref006","unstructured":"R.\u00a0Booth, M.W.A.\u00a0Caminada, M.\u00a0Podlaszewski and I.\u00a0Rahwan, Quantifying disagreement in argument-based reasoning, in: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, 2012."},{"key":"ref007","unstructured":"M.W.A.\u00a0Caminada, For the sake of the Argument. Explorations into argument-based reasoning, PhD thesis, Vrije Universiteit Amsterdam, 2004."},{"key":"ref008","unstructured":"M.W.A.\u00a0Caminada, On the issue of reinstatement in argumentation, in: Logics in Artificial Intelligence; 10th European Conference, JELIA 2006, M.\u00a0Fischer, W.\u00a0van der Hoek, B.\u00a0Konev and A.\u00a0Lisitsa, eds, LNAI, Vol.\u00a04160, Springer, 2006, pp.\u00a0111\u2013123."},{"key":"ref009","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75256-1_22"},{"key":"ref010","unstructured":"M.W.A.\u00a0Caminada, Strong admissibility revisited, in: Computational Models of Argument, Proceedings of COMMA 2014, S.\u00a0Parsons, N.\u00a0Oren, C.\u00a0Reed and F.\u00a0Cerutti, eds, IOS Press, 2014, pp.\u00a0197\u2013208."},{"key":"ref011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28460-6_4"},{"key":"ref012","doi-asserted-by":"crossref","unstructured":"M.W.A.\u00a0Caminada, A Discussion Protocol for Grounded Semantics (proofs), Technical Report, University of Aberdeen, 2015.","DOI":"10.1007\/978-3-319-28460-6_4"},{"key":"ref013","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.02.003"},{"key":"ref014","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exu005"},{"key":"ref015","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-009-9218-x"},{"key":"ref016","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-009-9116-7"},{"key":"ref017","unstructured":"M.W.A.\u00a0Caminada, G.\u00a0Pigozzi and M.\u00a0Podlaszewski, Manipulation in group argument evaluation, in: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, T.\u00a0Walsh, ed. 2011, pp.\u00a0121\u2013126."},{"key":"ref018","unstructured":"M.W.A.\u00a0Caminada and M.\u00a0Podlaszewski, Grounded semantics as persuasion dialogue, in: Computational Models of Argument \u2013 Proceedings of COMMA 2012, B.\u00a0Verheij, S.\u00a0Szeider and S.\u00a0Woltran, eds, 2012, pp.\u00a0478\u2013485."},{"key":"ref019","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"ref020","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00261-8"},{"key":"ref021","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0_6"},{"key":"ref022","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.10.008"},{"key":"ref023","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.11.001"},{"key":"ref024","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90103-5"},{"key":"ref025","doi-asserted-by":"publisher","DOI":"10.1080\/19462160903564592"},{"key":"ref026","doi-asserted-by":"publisher","DOI":"10.1080\/11663081.1997.10510900"},{"key":"ref027","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-40006-0_17"}],"container-title":["Argument &amp; Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-190463","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/AAC-190463","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-190463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:53:10Z","timestamp":1777377190000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/AAC-190463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,8]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,1,29]]}},"alternative-id":["10.3233\/AAC-190463"],"URL":"https:\/\/doi.org\/10.3233\/aac-190463","relation":{},"ISSN":["1946-2166","1946-2174"],"issn-type":[{"value":"1946-2166","type":"print"},{"value":"1946-2174","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,8]]}}}