{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T04:07:10Z","timestamp":1750478830714,"version":"3.41.0"},"reference-count":28,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2008,5,8]],"date-time":"2008-05-08T00:00:00Z","timestamp":1210204800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2008,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n\t  <jats:p>Given an argumentation framework <jats:italic>AF<\/jats:italic>, we introduce a mapping function that constructs a disjunctive logic program <jats:italic>P<\/jats:italic>, such that the preferred extensions of <jats:italic>AF<\/jats:italic> correspond to the stable models of <jats:italic>P<\/jats:italic>, after intersecting each stable model with the relevant atoms. The given mapping function is of polynomial size w.r.t. <jats:italic>AF<\/jats:italic>.<\/jats:p>\n\t  <jats:p>In particular, we identify that there is a direct relationship between the minimal models of a propositional formula and the preferred extensions of an argumentation framework by working on representing the defeated arguments. Then we show how to infer the preferred extensions of an argumentation framework by using UNSAT algorithms and disjunctive stable model solvers. The relevance of this result is that we define a direct relationship between one of the most satisfactory argumentation semantics and one of the most successful approach of nonmonotonic reasoning i.e., logic programming with the stable model semantics.<\/jats:p>","DOI":"10.1017\/s1471068408003359","type":"journal-article","created":{"date-parts":[[2008,5,8]],"date-time":"2008-05-08T10:39:58Z","timestamp":1210243198000},"page":"527-543","source":"Crossref","is-referenced-by-count":29,"title":["Preferred extensions as stable models"],"prefix":"10.1017","volume":"8","author":[{"given":"JUAN CARLOS","family":"NIEVES","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ULISES","family":"CORT\u00c9S","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MAURICIO","family":"OSORIO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2008,5,8]]},"reference":[{"key":"S1471068408003359_manual_ref-11","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"S1471068408003359_manual_ref-14","first-page":"360","volume-title":"JELIA","author":"Dunne","year":"2004"},{"key":"S1471068408003359_manual_ref-2","unstructured":"ASPIC: Project. 2006. ASPIC: Argumentation engine demo. URL: !http:\/\/aspic.acl.icnet.uk\/."},{"key":"S1471068408003359_manual_ref-13","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.artint.2007.05.003","article-title":"Computing ideal sceptical argumentation","volume":"171","author":"Dung","year":"2007","journal-title":"Artificial Intelligence"},{"key":"S1471068408003359_manual_ref-5","unstructured":"Besnard, P. and Doutre, S. 2004. Checking the acceptability of a set of arguments. In Tenth International Workshop on Non-Monotonic Reasoning (NMR 2004), 59\u201364."},{"key":"S1471068408003359_manual_ref-15","first-page":"133","volume-title":"Proceedings of COMMA","author":"Egly","year":"2006"},{"key":"S1471068408003359_manual_ref-16","first-page":"80","volume-title":"Argumentation and Non-Monotonic Reasoning (LPNMR-07 Workshop)","author":"Gaertner","year":"2007"},{"key":"S1471068408003359_manual_ref-19","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Computing"},{"key":"S1471068408003359_manual_ref-20","doi-asserted-by":"crossref","unstructured":"Leone, N. , Pfeifer, G. , Faber, W. , Calimeri, F. , Dell'Armi, T. , Eiter, T. , Gottlob, G. , Ianni, G. , Ielpa, G. , Koch, C. , Perri, S. and Polleres, A. 2002. The dlv system. In JELIA, 537\u2013540.","DOI":"10.1007\/3-540-45757-7_50"},{"volume-title":"Studying the Grounded Semantics by Using a Suitable Codification","year":"2008","author":"Nieves","key":"S1471068408003359_manual_ref-22"},{"key":"S1471068408003359_manual_ref-26","first-page":"263","volume-title":"2003 Joint Conference on Declarative Programming, AGP-2003","author":"Ricca","year":"2003"},{"key":"S1471068408003359_manual_ref-23","first-page":"225","article-title":"Applications of intuitionistic logic in answer set programming","volume":"4","author":"Osorio","year":"2004","journal-title":"Theory and Practice of Logic Programming (TPLP)"},{"key":"S1471068408003359_manual_ref-27","unstructured":"Tolchinsky, P. , Cort\u00e9s, U. , Nieves, J. C. , L\u00f3pez-Navidad, A. and Caballero, F. 2005. Using arguing agents to increase the human organ pool for transplantation. In Proceedings of the Third Workshop on Agents Applied in Health Care (IJCAI 2005)."},{"key":"S1471068408003359_manual_ref-10","unstructured":"DLV, S. 1996. Vienna University of Technology. URL: http:\/\/www.dbai.tuwien.ac.at\/proj\/dlv\/."},{"volume-title":"Logic and Structure","year":"1994","author":"van","key":"S1471068408003359_manual_ref-28"},{"key":"S1471068408003359_manual_ref-9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0304-3975(96)80707-9","article-title":"Graph theoretical structures in logic programs and default theories","volume":"170","author":"Dimopoulos","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"S1471068408003359_manual_ref-3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2005.06.003","article-title":"An incremental algorithm for generating all minimal models","volume":"169","author":"Ben-Eliyahu-Zohary","year":"2005","journal-title":"Artificial Intelligence"},{"key":"S1471068408003359_manual_ref-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.07.002"},{"key":"S1471068408003359_manual_ref-17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72200-7_3"},{"key":"S1471068408003359_manual_ref-7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1093\/logcom\/13.3.377","article-title":"On decision problems related to the preferred semantics for argumentation frameworks","volume":"13","author":"Cayrol","year":"2003","journal-title":"Journal of Logic and Computation"},{"key":"S1471068408003359_manual_ref-21","doi-asserted-by":"publisher","DOI":"10.1109\/ENC.2006.10"},{"key":"S1471068408003359_manual_ref-4","unstructured":"Bench-Capon, T. 2002. Value-based argumentation frameworks. In Proceedings of Non Monotonic Reasoning, 444\u2013453."},{"key":"S1471068408003359_manual_ref-24","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1887.001.0001"},{"key":"S1471068408003359_manual_ref-6","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0004-3702(97)00015-5","article-title":"An abstract, argumentation-theoretic approach to default reasoning","volume":"93","author":"Bondarenko","year":"1997","journal-title":"Artificial Intelligence"},{"key":"S1471068408003359_manual_ref-8","unstructured":"Cort\u00e9s, U. , Tolchinsky, P. , Nieves, J. C. , L\u00f3pez-Navidad, A. and Caballero, F. 2005. Arguing the discard of organs for transplantation in CARREL. In CATAI 2005, 93\u2013105."},{"key":"S1471068408003359_manual_ref-18","first-page":"620","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"Gelder","year":"1991","journal-title":"Journal of the ACM"},{"key":"S1471068408003359_manual_ref-25","first-page":"219","volume-title":"Handbook of Philosophical Logic","author":"Prakken","year":"2002"},{"key":"S1471068408003359_manual_ref-1","unstructured":"ASPIC: Project. 2005. Deliverable D2.2:Formal semantics for inference and decision-making. Argumentation Service Plarform with Integrated Components."}],"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\/S1471068408003359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T22:04:09Z","timestamp":1750457049000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068408003359\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,8]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["S1471068408003359"],"URL":"https:\/\/doi.org\/10.1017\/s1471068408003359","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2008,5,8]]}}}