{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T16:46:45Z","timestamp":1790700405660,"version":"4.1.0"},"reference-count":35,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"unspecified","delay-in-days":20,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recently there has been an increasing interest in frameworks extending Dung\u2019s abstract Argumentation Framework (AF). Popular extensions include bipolar AFs and AFs with recursive attacks and necessary supports. Although the relationships between AF semantics and Partial Stable Models (PSMs) of logic programs has been deeply investigated, this is not the case for more general frameworks extending AF.<\/jats:p><jats:p>In this paper we explore the relationships between AF-based frameworks and PSMs. We show that every AF-based framework \u0394 can be translated into a logic program <jats:italic>P<\/jats:italic><jats:sub>\u0394<\/jats:sub> so that the extensions prescribed by different semantics of \u0394 coincide with subsets of the PSMs of <jats:italic>P<\/jats:italic><jats:sub>\u0394<\/jats:sub>. We provide a logic programming approach that characterizes, in an elegant and uniform way, the semantics of several AF-based frameworks. This result allows also to define the semantics for new AF-based frameworks, such as AFs with recursive attacks and recursive deductive supports.<\/jats:p>","DOI":"10.1017\/s1471068420000253","type":"journal-article","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T05:25:42Z","timestamp":1600665942000},"page":"703-718","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":14,"title":["On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach"],"prefix":"10.1017","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7280-4759","authenticated-orcid":false,"given":"Gianvincenzo","family":"Alfano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergio","family":"Greco","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Parisi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Irina","family":"Trubitsyna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2020,9,21]]},"reference":[{"key":"S1471068420000253_ref16","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.jal.2014.12.001","article-title":"An approach to abstract argumentation with recursive attack and support","volume":"4","author":"Cohen","year":"2015","journal-title":"J. Appl. Log. 13"},{"key":"S1471068420000253_ref25","doi-asserted-by":"crossref","unstructured":"25. Greco, S. and Parisi, F. 2016. Incremental computation of deterministic extensions for dynamic argumentation frameworks. In JELIA. 288\u2013304.10.1007\/978-3-319-48758-8_19","DOI":"10.1007\/978-3-319-48758-8_19"},{"key":"S1471068420000253_ref11","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1613\/jair.5581","article-title":"On the equivalence between assumption-based argumentation and logic programming","author":"Caminada","year":"2017","journal-title":"JAIR 60"},{"key":"S1471068420000253_ref21","first-page":"434","article-title":"Improved answer-set programming encodings for abstract argumentation","volume":"4","author":"Gaggl","year":"2015","journal-title":"TPLP 15"},{"key":"S1471068420000253_ref33","doi-asserted-by":"crossref","unstructured":"33. Simari, G. R. and Rahwan, I. , Eds. 2009. Argumentation in Artificial Intelligence.","DOI":"10.1007\/978-0-387-98197-0"},{"key":"S1471068420000253_ref34","first-page":"163","article-title":"Modelling defeasible and prioritized support in bipolar argumentation","volume":"1","author":"Villata","year":"2012","journal-title":"AMAI 66"},{"key":"S1471068420000253_ref26","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1006\/inco.1999.2800","article-title":"Complexity and expressive power of deterministic semantics for datalog\u2013","volume":"1","author":"Greco","year":"1999","journal-title":"Inf. Comput. 153"},{"key":"S1471068420000253_ref8","first-page":"66","article-title":"A novel weighted defence and its relaxation in abstract argumentation","author":"Bistarelli","year":"2018","journal-title":"IJAR 92"},{"key":"S1471068420000253_ref35","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s11225-009-9210-5","article-title":"Complete extensions in argumentation coincide with 3-valued stable models in logic programming","volume":"2","author":"Wu","year":"2009","journal-title":"Studia Logica 93"},{"key":"S1471068420000253_ref4","first-page":"193","article-title":"A meta-argumentation approach for the efficient computation of stable and preferred extensions in dynamic bipolar argumentation frameworks","volume":"2","author":"Alfano","year":"2018","journal-title":"Intelligenza Artificiale 12"},{"key":"S1471068420000253_ref32","doi-asserted-by":"crossref","first-page":"261","DOI":"10.3233\/FI-2017-1585","article-title":"Representing argumentation frameworks in answer set programming","volume":"3","author":"Sakama","year":"2017","journal-title":"Fundam. Inform. 155"},{"key":"S1471068420000253_ref17","first-page":"1","article-title":"Argument graphs and assumption-based argumentation","author":"Craven","year":"2016","journal-title":"AI 233"},{"key":"S1471068420000253_ref6","first-page":"19","article-title":"AFRA: Argumentation Framework with Recursive Attacks","volume":"1","author":"Baroni","year":"2011","journal-title":"IJAR 52"},{"key":"S1471068420000253_ref19","first-page":"321","article-title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games","author":"Dung","year":"1995","journal-title":"AI 77"},{"key":"S1471068420000253_ref3","first-page":"49","article-title":"Efficient computation of extensions for dynamic abstract argumentation frameworks: An incremental approach","author":"Alfano","year":"2017","journal-title":"In IJCAI."},{"key":"S1471068420000253_ref2","unstructured":"2. Alfano, G. , Cohen, A. , Gottifredi, S. , Greco, S. , Parisi, F. , and Simari, G. R. 2020. Dynamics in abstract argumentation frameworks with recursive attack and support relations. In ECAI (To appear)."},{"key":"S1471068420000253_ref23","unstructured":"23. Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In ICSLP. 1070\u20131080."},{"key":"S1471068420000253_ref27","unstructured":"27. Janhunen, T. , Niemel\u00e4, I. , Seipel, D. , Simons, P. , and You, J.-H. 2006. Unfolding partiality and disjunctions in stable model semantics. ACM Trans. Comput. Logic 7, 1."},{"key":"S1471068420000253_ref12","doi-asserted-by":"crossref","unstructured":"12. Cayrol, C. , Fandinno, J. , del Cerro, L. F. , and Lagasquie-Schiex, M. 2017. Valid attacks in argumentation frameworks with recursive attacks. In Proc. of COMMONSENSE.","DOI":"10.1007\/978-3-319-90050-6_9"},{"key":"S1471068420000253_ref31","doi-asserted-by":"crossref","unstructured":"31. Sacc\u00e0, D. and Zaniolo, C. 1990. Stable models and non-determinism in logic programs with negation. In PODS. 205\u2013217.","DOI":"10.1145\/298514.298572"},{"key":"S1471068420000253_ref20","article-title":"On the complexity of probabilistic abstract argumentation frameworks","volume":"3","author":"Fazzinga","year":"2015","journal-title":"TOCL 16"},{"key":"S1471068420000253_ref5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s10472-011-9271-9","article-title":"A new approach for preference-based argumentation frameworks","volume":"2","author":"Amgoud","year":"2011","journal-title":"Ann. Math. Artif. Intell. 63,"},{"key":"S1471068420000253_ref30","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1006\/jcss.1997.1446","article-title":"The expressive powers of stable models for bound and unbound DATALOG queries","volume":"3","author":"Sacc\u00e0","year":"1997","journal-title":"J. Comput. Syst. Sci. 54,"},{"key":"S1471068420000253_ref24","first-page":"336","article-title":"Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations","author":"Gottifredi","year":"2018","journal-title":"AI 262"},{"key":"S1471068420000253_ref7","unstructured":"7. Bench-Capon, T. and Dunne, P. E. 2007. Argumentation in artificial intelligence. AI 171, 619\u2013641."},{"key":"S1471068420000253_ref1","first-page":"941","article-title":"On the equivalence between abstract dialectical frameworks and logic programs","volume":"5","author":"Alc\u00e2ntara","year":"2019","journal-title":"TPLP 19"},{"key":"S1471068420000253_ref14","first-page":"876","article-title":"Bipolarity in argumentation graphs: Towards a better understanding","volume":"7","author":"Cayrol","year":"2013","journal-title":"IJAR 54"},{"key":"S1471068420000253_ref22","first-page":"5450","article-title":"Evaluation techniques and systems for answer set programming: a survey","author":"Gebser","year":"2018","journal-title":"In IJCAI."},{"key":"S1471068420000253_ref29","doi-asserted-by":"crossref","unstructured":"29. Nouioua, F. and Risch, V. 2011. Argumentation frameworks with necessities. In SUM. 163\u2013176.","DOI":"10.1007\/978-3-642-23963-2_14"},{"key":"S1471068420000253_ref13","first-page":"29","article-title":"Structure-based semantics of argumentation frameworks with higher-order attacks and supports","author":"Cayrol","year":"2018","journal-title":"In COMMA."},{"key":"S1471068420000253_ref9","first-page":"63","article-title":"An abstract, argumentation-theoretic approach to default reasoning","author":"Bondarenko","year":"1997","journal-title":"AI 93"},{"key":"S1471068420000253_ref15","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1017\/S0269888913000325","article-title":"A survey of different approaches to support in argumentation systems","volume":"5","author":"Cohen","year":"2014","journal-title":"The Know. Eng. Rev. 29,"},{"key":"S1471068420000253_ref18","unstructured":"18. Dung, P. M. 1991. Negations as hypotheses: An abductive foundation for logic programming. In ICLP. 3\u201317."},{"key":"S1471068420000253_ref10","first-page":"87","article-title":"On the equivalence between logic programming semantics and argumentation semantics","author":"Caminada","year":"2015","journal-title":"IJAR 58"},{"key":"S1471068420000253_ref28","first-page":"901","article-title":"Reasoning about preferences in argumentation frameworks","volume":"9","author":"Modgil","year":"2009","journal-title":"AI 173"}],"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\/S1471068420000253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,14]],"date-time":"2021-01-14T08:53:33Z","timestamp":1610614413000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068420000253\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["S1471068420000253"],"URL":"https:\/\/doi.org\/10.1017\/s1471068420000253","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9]]},"assertion":[{"value":"\u00a9 The Author(s), 2020. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}