{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T01:11:25Z","timestamp":1771981885659,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T00:00:00Z","timestamp":1761696000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["SoftwareX"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1016\/j.softx.2025.102434","type":"journal-article","created":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T19:32:58Z","timestamp":1764012778000},"page":"102434","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A graph convolutional network-based solver for approximating argument acceptability"],"prefix":"10.1016","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2273-9998","authenticated-orcid":false,"given":"Lars","family":"Malmqvist","sequence":"first","affiliation":[]},{"given":"Peter","family":"Nightingale","sequence":"additional","affiliation":[]},{"given":"Tangming","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.softx.2025.102434_b1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","article-title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games","volume":"77","author":"Dung","year":"1995","journal-title":"Artificial Intelligence"},{"issue":"10\u201315","key":"10.1016\/j.softx.2025.102434_b2","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/j.artint.2007.05.001","article-title":"Argumentation in artificial intelligence","volume":"171","author":"Bench-Capon","year":"2007","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.softx.2025.102434_b3","series-title":"Argumentation in multi-agent systems","first-page":"357","article-title":"The added value of argumentation","author":"Modgil","year":"2013"},{"key":"10.1016\/j.softx.2025.102434_b4","doi-asserted-by":"crossref","unstructured":"Kotonya N, Toni F. Explainable automated fact-checking for public health claims. In: Proceedings of the 2020 conference on empirical methods in natural language processing. 2020, p. 7740\u201354.","DOI":"10.18653\/v1\/2020.emnlp-main.623"},{"key":"10.1016\/j.softx.2025.102434_b5","doi-asserted-by":"crossref","first-page":"94","DOI":"10.58496\/BJN\/2023\/012","article-title":"A comprehensive analysis of keras: Enhancing deep learning applications in network engineering","volume":"2023","author":"Lafta","year":"2023","journal-title":"Babylon J Netw"},{"issue":"4","key":"10.1016\/j.softx.2025.102434_b6","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1017\/S0269888911000166","article-title":"An introduction to argumentation semantics","volume":"26","author":"Baroni","year":"2011","journal-title":"Knowl Eng Rev"},{"key":"10.1016\/j.softx.2025.102434_b7","series-title":"Handbook of formal argumentation","first-page":"631","article-title":"Computational problems in formal argumentation and their complexity","author":"Dvor\u00e1k","year":"2018"},{"key":"10.1016\/j.softx.2025.102434_b8","unstructured":"Malmqvist L, Yuan T, Nightingale P, Manandhar S. Determining the Acceptability of Abstract Arguments with Graph Convolutional Networks. In: Proceedings of the second international workshop on systems and algorithms for formal argumentation. 2020, p. 47\u201356."},{"key":"10.1016\/j.softx.2025.102434_b9","series-title":"International competition on computational models of argument","article-title":"AFGCN: An approximate abstract argumentation solver","author":"Malmqvist","year":"2021"},{"key":"10.1016\/j.softx.2025.102434_b10","series-title":"Approximate solutions to abstract argumentation problems using graph neural networks","author":"Malmqvist","year":"2022"},{"key":"10.1016\/j.softx.2025.102434_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2024.104209","article-title":"Approximating problems in abstract argumentation with graph convolutional networks","volume":"336","author":"Malmqvist","year":"2024","journal-title":"Artificial Intelligence"},{"key":"10.1016\/j.softx.2025.102434_b12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.70470\/KHWARIZMIA\/2024\/012","article-title":"Using of computational fluid dynamics (CFD) and machine learning (ML) for predictive modelling in fluid dynamic","volume":"2024","author":"Hakim","year":"2024","journal-title":"KHWARIZMIA"},{"key":"10.1016\/j.softx.2025.102434_b13","unstructured":"Kipf TN, Welling M. Semi-supervised classification with graph convolutional networks. In: International conference on learning representations. 2017."},{"key":"10.1016\/j.softx.2025.102434_b14","series-title":"TAFA@iJCAI","article-title":"Approximate mechanisms for solving abstract argumentation frameworks","author":"Thimm","year":"2019"},{"key":"10.1016\/j.softx.2025.102434_b15","doi-asserted-by":"crossref","first-page":"125","DOI":"10.58496\/ADSA\/2025\/009","article-title":"Correcting convexity proofs for two signomial functions in geometric programming","volume":"2025","author":"Turyasingura","year":"2025","journal-title":"Appl Data Sci Anal"},{"key":"10.1016\/j.softx.2025.102434_b16","doi-asserted-by":"crossref","unstructured":"Craandijk D, Bex F. Deep learning for abstract argumentation semantics. In: Proceedings of the twenty-ninth international joint conference on artificial intelligence. 2020.","DOI":"10.3233\/FAIA200532"},{"issue":"1","key":"10.1016\/j.softx.2025.102434_b17","first-page":"1","article-title":"The third and fourth international competitions on computational models of argumentation: design, results and analysis","volume":"15","author":"Bistarelli","year":"2024","journal-title":"Argum Comput"},{"key":"10.1016\/j.softx.2025.102434_b18","article-title":"ICCMA: 5th international competition on computational models of argumentation","author":"J\u00e4rvisalo","year":"2023","journal-title":"Artif Intell"},{"key":"10.1016\/j.softx.2025.102434_b19","unstructured":"Cibier S, Mailly JG. A Comparison of Graph Neural Networks for Approximating Argumentation Semantics. In: Proceedings of the 10th international conference on computational models of argument. 2024."},{"key":"10.1016\/j.softx.2025.102434_b20","doi-asserted-by":"crossref","unstructured":"Kuhlmann I, Wujek M, Thimm M. On the impact of data selection when applying machine learning in abstract argumentation. In: Computational models of argument: proceedings of COMMA 2022. 2022, p. 271\u201382.","DOI":"10.3233\/FAIA220155"},{"key":"10.1016\/j.softx.2025.102434_b21","series-title":"CMNA","first-page":"40","article-title":"Improving misinformation detection in tweets with abstract argumentation","author":"Malmqvist","year":"2021"},{"key":"10.1016\/j.softx.2025.102434_b22","series-title":"Proceedings of the AAAI conference on artificial intelligence","first-page":"5573","article-title":"Enforcement heuristics for argumentation with deep reinforcement learning","volume":"vol. 36","author":"Craandijk","year":"2022"},{"key":"10.1016\/j.softx.2025.102434_b23","series-title":"Effects of graph neural network aggregation functions on generalizability for solving abstract argumentation semantics","author":"Craandijk","year":"2024"}],"container-title":["SoftwareX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352711025004005?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2352711025004005?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T00:50:17Z","timestamp":1771980617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2352711025004005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":23,"alternative-id":["S2352711025004005"],"URL":"https:\/\/doi.org\/10.1016\/j.softx.2025.102434","relation":{},"ISSN":["2352-7110"],"issn-type":[{"value":"2352-7110","type":"print"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A graph convolutional network-based solver for approximating argument acceptability","name":"articletitle","label":"Article Title"},{"value":"SoftwareX","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.softx.2025.102434","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"simple-article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"102434"}}