{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:53:20Z","timestamp":1757627600105,"version":"3.44.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032045867"},{"type":"electronic","value":"9783032045874"}],"license":[{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04587-4_6","type":"book-chapter","created":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T09:28:54Z","timestamp":1756805334000},"page":"78-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SCC-Recursiveness in\u00a0Infinite Argumentation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4653-7458","authenticated-orcid":false,"given":"Uri","family":"Andrews","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3156-6870","authenticated-orcid":false,"given":"Luca","family":"San Mauro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"key":"6_CR1","unstructured":"Andrews, U., San\u00a0Mauro, L.: On computational problems for infinite argumentation frameworks: Hardness of finding acceptable extensions. In: Proceedings of the 10th Workshop on Formal and Cognitive Reasoning (FCR-2024). CEUR Workshop Proceedings (2024), https:\/\/ceur-ws.org\/Vol-3763\/paper4.pdf"},{"key":"6_CR2","unstructured":"Andrews, U., San\u00a0Mauro, L.: On computational problems for infinite argumentation frameworks: the complexity of finding acceptable extensions. In: Proceedings of the 22nd International Workshop on Nonmonotonic Reasoning (NMR-2024). CEUR Workshop Proceedings (2024)"},{"key":"6_CR3","unstructured":"Andrews, U., San\u00a0Mauro, L.: On the complexity of the grounded semantics for infinite argumentation frameworks. In: Theoretical Aspects of Rationality & Knowledge (TARK) (2025)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Andrews, U., San\u00a0Mauro, L.: SCC-recursiveness in infinite argumentation (extended version) (2025), https:\/\/arxiv.org\/abs\/2507.06852","DOI":"10.1007\/978-3-032-04587-4_6"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Baroni, P., Cerutti, F., Dunne, P.E., Giacomin, M.: Computing with infinite argumentation frameworks: the case of AFRAs. In: Theorie and Applications of Formal Argumentation: First International Workshop, TAFA 2011. Barcelona, Spain, 16\u201317 July 2011, pp. 197\u2013214. Springer (2012)","DOI":"10.1007\/978-3-642-29184-5_13"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-540-45062-7_36","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"P Baroni","year":"2003","unstructured":"Baroni, P., Giacomin, M.: Solving semantic problems with odd-length cycles in argumentation. In: Nielsen, T.D., Zhang, N.L. (eds.) Symbolic and Quantitative Approaches to Reasoning with Uncertainty, pp. 440\u2013451. Springer, Berlin, Heidelberg (2003)"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Baroni, P., Giacomin, M.: On principle-based evaluation of extension-based argumentation semantics. Artif. Intell. 171(10), 675\u2013700 (2007). https:\/\/doi.org\/10.1016\/j.artint.2007.04.004, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0004370207000744, argumentation in Artificial Intelligence","DOI":"10.1016\/j.artint.2007.04.004"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Baroni, P., Giacomin, M.: Semantics of abstract argument systems. Argum. Artif. Intell. 25\u201344 (2009)","DOI":"10.1007\/978-0-387-98197-0_2"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Baroni, P., Giacomin, M., Guida, G.: SCC-recursiveness: a general schema for argumentation semantics. Artif. Intell. 168(1), 162\u2013210 (2005) https:\/\/doi.org\/10.1016\/j.artint.2005.05.006, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0004370205000962","DOI":"10.1016\/j.artint.2005.05.006"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Baumann, R., Spanring, C.: Infinite argumentation frameworks: on the existence and uniqueness of extensions. In: Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation: Essays Dedicated to Gerhard Brewka on the Occasion of his 60th Birthday, pp. 281\u2013295. Springer (2015)","DOI":"10.1007\/978-3-319-14726-0_19"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Baumann, R., Spanring, C.: A study of unrestricted abstract argumentation frameworks. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, 19\u201325 August 2017, pp. 807\u2013813. ijcai.org (2017). https:\/\/doi.org\/10.24963\/IJCAI.2017\/112","DOI":"10.24963\/IJCAI.2017\/112"},{"issue":"6","key":"6_CR12","first-page":"1589","volume":"8","author":"S Bistarelli","year":"2021","unstructured":"Bistarelli, S., Santini, F.: Weighted argumentation. J. Appl. Logics 8(6), 1589\u20131621 (2021)","journal-title":"J. Appl. Logics"},{"key":"6_CR13","unstructured":"Caminada, M., Oren, N.: Grounded semantics and infinitary argumentation frameworks. In: Proceedings of the 26th Benelux Conference on Artificial Intelligence, pp. 25\u201332. BNAIC (2014)"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321\u2013357 (1995)","journal-title":"Artif. Intell."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Dunne, P.E., Wooldridge, M.: Complexity of abstract argumentation. Argum. Artif. Intell. 85\u2013104 (2009)","DOI":"10.1007\/978-0-387-98197-0_5"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1093\/logcom\/exu006","volume":"26","author":"W Dvo\u0159\u00e1k","year":"2014","unstructured":"Dvo\u0159\u00e1k, W., Gaggl, S.A.: Stage semantics and the SCC-recursive schema for argumentation semantics. J. Log. Comput. 26(4), 1149\u20131202 (2014). https:\/\/doi.org\/10.1093\/logcom\/exu006","journal-title":"J. Log. Comput."},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Ebbinghaus, H.D., Flum, J., Thomas, W.: Mathematical logic, graduate texts in mathematics, vol.\u00a0291. Springer, Cham, third edn. ([2021] $$\\copyright $$2021). https:\/\/doi.org\/10.1007\/978-3-030-73839-6","DOI":"10.1007\/978-3-030-73839-6"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Gaggl, S.A.: A Comprehensive analysis of the cf2 argumentation semantics: from characterization to implementation. Ph.D. thesis, TU Wien (2013)","DOI":"10.1093\/logcom\/exs011"},{"issue":"5","key":"6_CR19","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1093\/logcom\/exs011","volume":"23","author":"SA Gaggl","year":"2012","unstructured":"Gaggl, S.A., Woltran, S.: The cf2 argumentation semantics revisited. J. Log. Comput. 23(5), 925\u2013949 (2012). https:\/\/doi.org\/10.1093\/logcom\/exs011","journal-title":"J. Log. Comput."},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1093\/logcom\/13.3.319","volume":"13","author":"B Verheij","year":"2003","unstructured":"Verheij, B.: Deflog: on the logical interpretation of prima facie justified assumptions. J. Log. Comput. 13(3), 319\u2013346 (2003)","journal-title":"J. Log. Comput."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04587-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:07:44Z","timestamp":1757477264000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04587-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,29]]},"ISBN":["9783032045867","9783032045874"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04587-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,29]]},"assertion":[{"value":"29 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors\u00a0have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kutaisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.jelia.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}