{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T10:28:58Z","timestamp":1776680938000,"version":"3.51.2"},"reference-count":45,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T00:00:00Z","timestamp":1730851200000},"content-version":"unspecified","delay-in-days":5,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2024,11]]},"abstract":"Abstract<\/jats:title>A framework with sets of attacking arguments (\n$\\textit{SETAF}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>) is an extension of the well-known Dung\u2019s Abstract Argumentation Frameworks (\n$\\mathit{AAF}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>s) that allows joint attacks on arguments. In this paper, we provide a translation from Normal Logic Programs (\n$\\textit{NLP}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>s) to \n$\\textit{SETAF}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>s and vice versa, from \n$\\textit{SETAF}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>s to \n$\\textit{NLP}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>s. We show that there is pairwise equivalence between their semantics, including the equivalence between \n$L$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-stable and semi-stable semantics. Furthermore, for a class of \n$\\textit{NLP}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>s called Redundancy-Free Atomic Logic Programs (\n$\\textit{RFALP}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>s), there is also a structural equivalence as these back-and-forth translations are each other\u2019s inverse. Then, we show that \n$\\textit{RFALP}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>s are as expressive as \n$\\textit{NLP}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>s by transforming any \n$\\textit{NLP}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> into an equivalent \n$\\textit{RFALP}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> through a series of program transformations already known in the literature. We also show that these program transformations are confluent, meaning that every \n$\\textit{NLP}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> will be transformed into a unique \n$\\textit{RFALP}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>. The results presented in this paper enhance our understanding that \n$\\textit{NLP}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>s and \n$\\textit{SETAF}$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>s are essentially the same formalism.<\/jats:p>","DOI":"10.1017\/s1471068424000188","type":"journal-article","created":{"date-parts":[[2024,11,6]],"date-time":"2024-11-06T03:55:58Z","timestamp":1730865358000},"page":"1208-1236","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":2,"title":["On the Equivalence between Logic Programming and SETAF"],"prefix":"10.1017","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4297-2970","authenticated-orcid":false,"given":"JO\u00c3O","family":"ALC\u00c2NTARA","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RENAN","family":"CORDEIRO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SAMY","family":"S\u00c1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2024,11,6]]},"reference":[{"key":"S1471068424000188_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(96)00115-X"},{"key":"S1471068424000188_ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.12.003"},{"key":"S1471068424000188_ref19","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5581"},{"key":"S1471068424000188_ref34","doi-asserted-by":"publisher","DOI":"10.3233\/FI-1990-13404"},{"key":"S1471068424000188_ref25","doi-asserted-by":"publisher","DOI":"10.3233\/AAC-190457"},{"key":"S1471068424000188_ref37","unstructured":"Rocha, V. H. N. and Cozman, F. G. 2022a. Bipolar argumentation frameworks with explicit conclusions: Connecting argumentation and logic programming. In CEUR Workshop Proceedings, CEUR-WS, 3197, 49\u201360."},{"key":"S1471068424000188_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.02.003"},{"key":"S1471068424000188_ref42","doi-asserted-by":"publisher","DOI":"10.1080\/19462166.2013.869878"},{"key":"S1471068424000188_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-51136-3_13"},{"key":"S1471068424000188_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"S1471068424000188_ref31","doi-asserted-by":"crossref","unstructured":"K\u00f6nig, M. , Rapberger, A. and Ulbricht, M. 2022. Just a matter of perspective: Intertranslating expressive argumentation formalisms. In Proceeding of the 9th International Conference on Computational Models of Argument (COMMA), 212\u2013223.","DOI":"10.3233\/FAIA220154"},{"key":"S1471068424000188_ref41","volume-title":"29th AAAI Conference on Artificial Intelligence.","author":"Schulz","year":"2015"},{"key":"S1471068424000188_ref11","unstructured":"Brewka, G. , Ellmauthaler, S. , Strass, H. , Wallner, J. P. and Woltran, S. 2013. Abstract dialectical frameworks revisited. In Proceedings of the Twenty-Third international joint conference on Artificial Intelligence, 803\u2013809."},{"key":"S1471068424000188_ref12","unstructured":"Brewka, G. and Woltran, S. 2010. Abstract dialectical frameworks. In Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning, 102\u2013111."},{"key":"S1471068424000188_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2014.12.004"},{"key":"S1471068424000188_ref28","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018947420290"},{"key":"S1471068424000188_ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20832-4_11"},{"key":"S1471068424000188_ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-009-9210-5"},{"key":"S1471068424000188_ref4","first-page":"629","article-title":"Argument strength in formal argumentation","volume":"5","author":"Beirlaen","year":"2018","journal-title":"FLAP"},{"key":"S1471068424000188_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.104011"},{"key":"S1471068424000188_ref39","doi-asserted-by":"crossref","unstructured":"S\u00e1, S. and Alc\u00e2ntara, J. 2021a. An abstract argumentation and logic programming comparison based on 5-valued labellings. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty: 16th European Conference, ECSQARU 2021, Springer, 159\u2013172.","DOI":"10.1007\/978-3-030-86772-0_12"},{"key":"S1471068424000188_ref44","first-page":"357","article-title":"Two approaches to dialectical argumentation: Admissible sets and argumentation stages","volume":"96","author":"Verheij","year":"1996","journal-title":"Proceeding NAIC"},{"key":"S1471068424000188_ref36","doi-asserted-by":"crossref","unstructured":"Rocha, V. H. N. and Cozman, F. G. 2022b. A credal least undefined stable semantics for probabilistic logic programs and probabilistic argumentation. In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning, 19, 309\u2013319.","DOI":"10.24963\/kr.2022\/31"},{"key":"S1471068424000188_ref38","doi-asserted-by":"crossref","unstructured":"S\u00e1, S. and Alc\u00e2ntara, J. 2019. Interpretations and models for assumption-based argumentation. In Proceedings of the 34th ACM\/SIGAPP Symposium on Applied Computing, 1139\u20131146.","DOI":"10.1145\/3297280.3297392"},{"key":"S1471068424000188_ref35","volume-title":"STAIRS@ ECAI.","author":"Rapberger","year":"2020"},{"key":"S1471068424000188_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)00104-E"},{"key":"S1471068424000188_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(98)10030-4"},{"key":"S1471068424000188_ref13","unstructured":"Caminada, M. 2006. Semi-stable semantics. In 1st International Conference on Computational Models of Argument (COMMA), 144, 121\u2013130."},{"key":"S1471068424000188_ref1","unstructured":"Alc\u00e2ntara, J. and S\u00e1, S. 2021. Equivalence results between SETAF and attacking abstract dialectical frameworks. In Proceedings NMR, 139\u2013148."},{"key":"S1471068424000188_ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2019.03.006"},{"key":"S1471068424000188_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41524-1_7"},{"key":"S1471068424000188_ref17","first-page":"15","article-title":"On the difference between assumption-based argumentation and abstract argumentation","volume":"2a","author":"Caminada","year":"2015","journal-title":"IFCoLog Journal of Logic and its Applications"},{"key":"S1471068424000188_ref14","first-page":"608","volume-title":"AAAI","volume":"6","author":"Caminada","year":"2005"},{"key":"S1471068424000188_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000280"},{"key":"S1471068424000188_ref7","first-page":"199","volume-title":"ICLP","author":"Brass","year":"1995"},{"key":"S1471068424000188_ref40","doi-asserted-by":"crossref","unstructured":"S\u00e1, S. and Alc\u00e2ntara, J. 2021b. Assumption-based argumentation is logic programming with projection. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty: 16th European Conference, ECSQARU 2021, Springer, 173\u2013186.","DOI":"10.1007\/978-3-030-86772-0_13"},{"key":"S1471068424000188_ref16","doi-asserted-by":"publisher","DOI":"10.3233\/AAC-200528"},{"key":"S1471068424000188_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(95)94697-X"},{"key":"S1471068424000188_ref32","first-page":"54","volume-title":"International Workshop on Argumentation in Multi-Agent Systems","author":"Nielsen","year":"2006"},{"key":"S1471068424000188_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00015-5"},{"key":"S1471068424000188_ref33","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068408003359"},{"key":"S1471068424000188_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-009-9218-x"},{"key":"S1471068424000188_ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.07.006"},{"key":"S1471068424000188_ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005952908693"},{"key":"S1471068424000188_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-98197-0_10"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068424000188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T02:02:55Z","timestamp":1736992975000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068424000188\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":45,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["S1471068424000188"],"URL":"https:\/\/doi.org\/10.1017\/s1471068424000188","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]},"assertion":[{"value":"\u00a9 The Author(s), 2024. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}