{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:45:57Z","timestamp":1777434357179,"version":"3.51.4"},"reference-count":36,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"},{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-19-P3IA-0002"],"award-info":[{"award-number":["ANR-19-P3IA-0002"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Argument &amp; Computation"],"published-print":{"date-parts":[[2025,10]]},"abstract":"<jats:p>Dialectical proof procedures in assumption-based argumentation are in general sound but not complete with respect to both the credulous and skeptical semantics (due to non-terminating loops). This raises the question of whether we could describe exactly what such procedures compute.<\/jats:p>\n                  <jats:p>In a previous paper, we introduce infinite arguments to represent possibly non-terminating computations and present dialectical proof procedures that are both sound and complete with respect to the credulous semantics of assumption-based argumentation with infinite arguments.<\/jats:p>\n                  <jats:p>\n                    In this paper, we study whether and under what conditions dialectical proof procedures are both sound and complete with respect to the grounded semantics of assumption-based argumentation with infinite arguments. We introduce the class of\n                    <jats:italic>\u03c9<\/jats:italic>\n                    -grounded and finitary-defensible argumentation frameworks and show that finitary assumption-based argumentation is\n                    <jats:italic>\u03c9<\/jats:italic>\n                    -grounded and finitary-defensible. We then present dialectical procedures that are sound and complete wrt finitary assumption-based argumentation.\n                  <\/jats:p>","DOI":"10.3233\/aac-230009","type":"journal-article","created":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T11:43:34Z","timestamp":1720179814000},"page":"324-361","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["<i>\u03c9<\/i>\n                    -Groundedness of argumentation and completeness of grounded dialectical proof procedures"],"prefix":"10.1177","volume":"16","author":[{"given":"Phan Minh","family":"Dung","sequence":"first","affiliation":[{"name":"Department of ICT, Asian Institute of Technology, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Phan Minh","family":"Thang","sequence":"additional","affiliation":[{"name":"International College of Burapha University, Burapha University, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiraporn","family":"Pooksook","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Naresuan University, Thailand"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.02.019"},{"key":"e_1_3_3_3_2","first-page":"55","author":"Arioua A.","year":"2016","unstructured":"Arioua A., Croitoru M., A dialectical proof theory for universal acceptance in coherent logic-based argumentation frameworks, in: Proceedings of the 22nd European Conference on Artificial Intelligence, ECAI 2016, 2016, pp.\u00a055\u201363, http:\/\/liris.cnrs.fr\/~aarioua\/papers\/ECAI2016.pdf.","journal-title":"Proceedings of the 22nd European Conference on Artificial Intelligence, ECAI 2016"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14726-0_19"},{"key":"e_1_3_3_5_2","first-page":"861","author":"Belardinelli F.","year":"2015","unstructured":"Belardinelli F., Grossi D., Maudet N., Formal analysis of dialogues on infinite argumentation frameworks, in: Proceedings of the 24th International Conference on Artificial Intelligence, IJCAI\u201915, AAAI Press, 2015, pp.\u00a0861\u2013867. ISBN 9781577357384.","journal-title":"Proceedings of the 24th International Conference on Artificial Intelligence, IJCAI\u201915"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093634995"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00015-5"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2010.36"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/13.3.377"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1342991.1342998"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09510-1_15"},{"key":"e_1_3_3_13_2","first-page":"3","author":"Dung P.M.","year":"1991","unstructured":"Dung P.M., Negation by hypothesis, an abductive foundation of logic programming, in: 8th International Conference on Logic Programming, The MIT Press, Cambridge, and Massachusetts, 1991, pp.\u00a03\u201317.","journal-title":"8th International Conference on Logic Programming"},{"key":"e_1_3_3_14_2","unstructured":"Dung P.M. Logic programming as dialogue games Technical report Division of Computer Science Asian Institute of Technology Thailand (submitted to LPNMR 1993) 1993."},{"key":"e_1_3_3_15_2","first-page":"852","author":"Dung P.M.","year":"1993","unstructured":"Dung P.M., On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, in: Proceedings of the 13th International Joint Conference in Artificial Intelligence (IJCAI), 1993, pp.\u00a0852\u2013857.","journal-title":"Proceedings of the 13th International Joint Conference in Artificial Intelligence (IJCAI)"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(95)94697-X"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.07.002"},{"key":"e_1_3_3_19_2","author":"Dung P.M.","year":"2009","unstructured":"Dung P.M., Kowalski R.A., Toni F., Assumption-based argumentation, in: Argumentation in AI, Springer-Verlag, 2009.","journal-title":"Argumentation in AI"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.05.003"},{"key":"e_1_3_3_21_2","author":"Dung P.M.","year":"2009","unstructured":"Dung P.M., Thang P.M., A modular framework for dialectical dispute in argumentation, in: Proc of IJCAI, 2009.","journal-title":"Proc of IJCAI"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(03)00076-6"},{"key":"e_1_3_3_23_2","first-page":"234","author":"Eshghi K.","year":"1989","unstructured":"Eshghi K., Kowalski R.A., Abduction compared with negation by failure, in: Logic Programming: Proceedings of the Sixth International Conference, The MIT Press, Cambridge, and Massachusetts, 1989, pp.\u00a0234\u2013254.","journal-title":"Logic Programming: Proceedings of the Sixth International Conference"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.06.001"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2007.105"},{"key":"e_1_3_3_26_2","author":"Manna Z.","year":"1985","unstructured":"Manna Z., Waldinger R., The Logical Basis for Computer Programming, Addison\u2013Wesley Professional, 1985.","journal-title":"The Logical Basis for Computer Programming"},{"key":"e_1_3_3_27_2","author":"Modgil S.","year":"2009","unstructured":"Modgil S., Caminada M., Proof theories and algorithms for abstract argumentation, in: Argumentation in AI, Springer Verlag, 2009.","journal-title":"Argumentation in AI"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.10.008"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1080\/19462160903564592"},{"key":"e_1_3_3_30_2","unstructured":"Spanring C. Set- and graph-theoretic investigations in abstract argumentation PhD thesis University of Liverpool UK 2017."},{"key":"e_1_3_3_31_2","author":"Thang P.M.","year":"2019","unstructured":"Thang P.M., Dung P.M., Tribute to Guillermo Simari: Infinite Arguments and Semantics of Assumption-Based Argumentation, College Publication, 2019.","journal-title":"Tribute to Guillermo Simari: Infinite Arguments and Semantics of Assumption-Based Argumentation"},{"issue":"2","key":"e_1_3_3_32_2","first-page":"114","article-title":"Infinite arguments and semantics of dialectical proof procedure","volume":"170","author":"Thang P.M.","year":"2020","unstructured":"Thang P.M., Dung P.M., Pooksook J., Infinite arguments and semantics of dialectical proof procedure, J. Arguments and Computation 170(2) (2020), 114\u2013159.","journal-title":"J. Arguments and Computation"},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.09.010"},{"key":"e_1_3_3_34_2","article-title":"A tutorial on assumption-based argumentation","author":"Toni F.","year":"2013","unstructured":"Toni F., A tutorial on assumption-based argumentation, Journal of Arguments and Computation (2013).","journal-title":"Journal of Arguments and Computation"},{"key":"e_1_3_3_35_2","first-page":"623","author":"Verheij B.","year":"2007","unstructured":"Verheij B., A labeling approach to the computation of credulous acceptance in argumentation, in: JCAI 2007, Veloso M., ed., Morgan Kaufmann, 2007, pp.\u00a0623\u2013628.","journal-title":"JCAI 2007"},{"key":"e_1_3_3_36_2","first-page":"239","volume":"1919","author":"Vreeswijk G.","year":"2000","unstructured":"Vreeswijk G., Prakken H., Credulous and sceptical argument games for preferred semantics, in: JELIA 2000, Ojeda-Aciego M., de\u00a0Guzm\u00e1n I.P., Brewka G., Pereira L.M., eds, Lecture Notes in Computer Science, Vol.\u00a01919, Springer, 2000, pp.\u00a0239\u2013253.","journal-title":"JELIA 2000"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000494"}],"container-title":["Argument &amp; Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-230009","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/AAC-230009","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-230009","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:53:30Z","timestamp":1777377210000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/AAC-230009"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,3]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["10.3233\/AAC-230009"],"URL":"https:\/\/doi.org\/10.3233\/aac-230009","relation":{},"ISSN":["1946-2166","1946-2174"],"issn-type":[{"value":"1946-2166","type":"print"},{"value":"1946-2174","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,3]]}}}