{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T03:43:19Z","timestamp":1777434199586,"version":"3.51.4"},"reference-count":47,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T00:00:00Z","timestamp":1618185600000},"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":[[2022,2,21]]},"abstract":"<jats:p>The connection between logic programming and formal argumentation has been studied starting from the landmark 1995 paper of Dung. Subsequent work has identified a standard translation from logic programs to (instantiated) argumentation frameworks, under which pairwise correspondences hold between various logic programming semantics and various formal argumentation semantics. This includes the correspondence between 3-valued stable and complete semantics, between well-founded and grounded semantics and between 2-valued stable (LP) and stable (argumentation) semantics. In the current paper, we show that the existing translation is able to yield the additional correspondence between ideal semantics for logic programming and ideal semantics for formal argumentation. We also show that correspondence does not hold between eager semantics for logic programming and eager semantics for formal argumentation, at least when translating from logic programming to formal argumentation. Overall, the current work should be seen as completing the analysis of correspondences between mainstream admissibility-based argumentation semantics and their logic programming counterparts.<\/jats:p>","DOI":"10.3233\/aac-200528","type":"journal-article","created":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T15:09:39Z","timestamp":1618326579000},"page":"93-120","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["Comparing logic programming and formal argumentation; the case of ideal and eager semantics"],"prefix":"10.1177","volume":"13","author":[{"given":"Martin","family":"Caminada","sequence":"first","affiliation":[{"name":"Cardiff University, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sri","family":"Harikrishnan","sequence":"additional","affiliation":[{"name":"Cardiff University, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samy","family":"S\u00e1","sequence":"additional","affiliation":[{"name":"Universidade Federal do Cear\u00e1, Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2021,4,12]]},"reference":[{"key":"ref001","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000280"},{"key":"ref002","doi-asserted-by":"crossref","unstructured":"J.J.\u00a0Alferes, P.M.\u00a0Dung and L.\u00a0Pereira, Scenario semantics of extended logic programs, in: Proc. 2nd International Workshop on Logic Programming and Non-monotonic Reasoning, A.\u00a0Nerode and L.\u00a0Pereira, eds, MIT Press, 1993, pp.\u00a0334\u2013348.","DOI":"10.7551\/mitpress\/4307.003.0029"},{"key":"ref003","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-011-9271-9"},{"key":"ref004","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888911000166"},{"key":"ref005","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.04.004"},{"key":"ref006","unstructured":"R.\u00a0Baumann, On the nature of argumentation semantics: Existence and uniqueness, expressibility, and replaceability, in: Handbook of Formal Argumentation, Vol.\u00a01, College Publications, 2018."},{"key":"ref007","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14726-0_19"},{"key":"ref008","doi-asserted-by":"publisher","DOI":"10.1080\/19462166.2013.869765"},{"key":"ref009","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00015-5"},{"key":"ref010","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":"ref011","unstructured":"M.W.A.\u00a0Caminada, Comparing two unique extension semantics for formal argumentation: Ideal and eager, in: Proceedings of the 19th Belgian-Dutch Conference on Artificial Intelligence (BNAIC 2007), M.M.\u00a0Dastani and E.\u00a0de\u00a0Jong, eds, 2007, pp.\u00a081\u201387."},{"key":"ref012","unstructured":"M.W.A.\u00a0Caminada, Argumentation semantics as formal discussion, in: Handbook of Formal Argumentation, Vol.\u00a01, College Publications, 2018, pp.\u00a0487\u2013518."},{"key":"ref013","unstructured":"M.W.A.\u00a0Caminada, P.\u00a0Baroni and M.\u00a0Giacomin, Abstract argumentation frameworks and their semantics, in: Handbook of Formal Argumentation, Vol.\u00a01, College Publications, 2018."},{"key":"ref014","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-009-9218-x"},{"key":"ref015","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-009-9116-7"},{"key":"ref016","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2014.12.004"},{"key":"ref017","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5581"},{"key":"ref018","unstructured":"M.W.A.\u00a0Caminada and S.\u00a0Uebis, An implementation of argument-based discussion using aspic, in: Computational Models of Argument. Proceedings of COMMA 2020, H.\u00a0Prakken, S.\u00a0Bistarelli, F.\u00a0Santini and C.\u00a0Taticchi, eds, IOS Press, 2020, pp.\u00a0455\u2013456."},{"key":"ref019","unstructured":"M.W.A.\u00a0Caminada and B.\u00a0Verheij, On the existence of semi-stable extensions, in: Proceedings of the 22nd Benelux Conference on Artificial Intelligence, G.\u00a0Danoy, M.\u00a0Seredynski, R.\u00a0Booth, B.\u00a0Gateau, I.\u00a0Jars and D.\u00a0Khadraoui, eds, 2010."},{"key":"ref020","unstructured":"K.\u00a0\u010cyras, X.\u00a0Fan, C.\u00a0Schulz and F.\u00a0Toni, Assumption-based argumentation: Disputes, explanations, preferences, in: Handbook of Formal Argumentation, Vol.\u00a01, College Publications, 2018."},{"key":"ref021","unstructured":"K.\u00a0\u010cyras and F.\u00a0Toni, Aba+: Assumption-based argumentation with preferences, in: Proceedings of the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), 2016, pp.\u00a0553\u2013556."},{"key":"ref022","doi-asserted-by":"publisher","DOI":"10.1111\/j.0824-7935.2004.00240.x"},{"key":"ref023","doi-asserted-by":"publisher","DOI":"10.3233\/FI-1995-2233"},{"key":"ref024","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"ref025","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.05.003"},{"key":"ref026","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.12.003"},{"key":"ref027","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/14.5.675"},{"key":"ref028","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/9.2.215"},{"key":"ref029","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90015-U"},{"key":"ref030","unstructured":"B.\u00a0Marshall, R.\u00a0Booth and M.W.A.\u00a0Caminada, Disco: A web-based implementation of discussion games for grounded and preferred semantics, in: Computational Models of Argument. Proceedings of COMMA 2018, J.\u00a0Lawrence, S.\u00a0Modgil and K.\u00a0Budzynska, eds, 2018, pp.\u00a0453\u2013454."},{"key":"ref031","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.10.008"},{"key":"ref032","doi-asserted-by":"publisher","DOI":"10.1080\/19462166.2013.869766"},{"key":"ref033","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-75553-3"},{"key":"ref034","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exu014"},{"key":"ref035","doi-asserted-by":"publisher","DOI":"10.3233\/FI-1990-13404"},{"key":"ref036","unstructured":"S.\u00a0S\u00e1, On the expressive power of argumentation formalisms, in: Online Handbook of Argumentation for AI, 2020, p.\u00a033."},{"key":"ref037","doi-asserted-by":"crossref","unstructured":"S.\u00a0S\u00e1 and J.\u00a0Alc\u00e2ntara, Interpretations and models for assumption-based argumentation, in: Proceedings of the 34th ACM\/SIGAPP Symposium on Applied Computing, SAC \u201919, Association for Computing Machinery, New York, NY, USA, 2019, pp.\u00a01139\u20131146.","DOI":"10.1145\/3297280.3297392"},{"key":"ref038","doi-asserted-by":"crossref","unstructured":"D.\u00a0Sacc\u00e0 and C.\u00a0Zaniolo, Stable models and non-determinism in logic programs with negation, in: Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Nashville, Tennessee, USA, April 2\u20134, 1990, D.J.\u00a0Rosenkrantz and Y.\u00a0Sagiv, eds, ACM Press, 1990, pp.\u00a0205\u2013217.","DOI":"10.1145\/298514.298572"},{"key":"ref039","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/7.5.555"},{"key":"ref040","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00054-0"},{"key":"ref041","unstructured":"R.\u00a0Silva, S.\u00a0S\u00e1 and J.\u00a0Alc\u00e2ntara, Semantics hierarchy in preference-based argumentation frameworks, in: Computational Models of Argument \u2013 Proceedings of COMMA 2020, Perugia, Italy, September 4\u201311, 2020, H.\u00a0Prakken, S.\u00a0Bistarelli, F.\u00a0Santini and C.\u00a0Taticchi, eds, Frontiers in Artificial Intelligence and Applications, Vol.\u00a0326, IOS Press, 2020, pp.\u00a0339\u2013346."},{"key":"ref042","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.09.004"},{"key":"ref043","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exp032"},{"key":"ref044","doi-asserted-by":"publisher","DOI":"10.1080\/19462166.2013.869878"},{"key":"ref045","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exs066"},{"key":"ref046","unstructured":"E.\u00a0Weydert, Semi-stable extensions for infinite frameworks, in: Proceedings of the 23rd Benelux Conference on Artificial Intelligence (BNAIC 2011), P.\u00a0de\u00a0Causmaecker, J.\u00a0Maervoet, T.\u00a0Messelis, K.\u00a0Verbeeck and T.\u00a0Vermeulen, eds, 2011, pp.\u00a0336\u2013343."},{"key":"ref047","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-009-9210-5"}],"container-title":["Argument &amp; Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-200528","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/AAC-200528","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/AAC-200528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:53:18Z","timestamp":1777377198000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/AAC-200528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,12]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2,21]]}},"alternative-id":["10.3233\/AAC-200528"],"URL":"https:\/\/doi.org\/10.3233\/aac-200528","relation":{},"ISSN":["1946-2166","1946-2174"],"issn-type":[{"value":"1946-2166","type":"print"},{"value":"1946-2174","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,12]]}}}