{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T13:00:23Z","timestamp":1761310823086,"version":"build-2065373602"},"reference-count":22,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:00:00Z","timestamp":1756166400000},"content-version":"unspecified","delay-in-days":56,"URL":"https:\/\/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":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    In this paper, we compare four different semantics for disjunction in Answer Set Programming that, unlike stable models, do not adhere to the principle of model minimality. Two of these approaches, Cabalar and Mu\u00f1iz\u2019\n                    <jats:italic>Justified Models<\/jats:italic>\n                    and Doherty and Szalas\u2019\n                    <jats:italic>Strongly Supported Models<\/jats:italic>\n                    , directly provide an alternative non-minimal semantics for disjunction. The other two, Aguado et al\u2019s\n                    <jats:italic>Forks<\/jats:italic>\n                    and Shen and Eiter\u2019s\n                    <jats:italic>Determining Inference<\/jats:italic>\n                    (DI) semantics, actually introduce a new disjunction connective, but are compared here as if they constituted new semantics for the standard disjunction operator. We are able to prove that three of these approaches (Forks, Justified Models and a reasonable relaxation of the DI-semantics) actually coincide, constituting a common single approach under different definitions. Moreover, this common semantics always provides a superset of the stable models of a programme (in fact, modulo any context) and is strictly stronger than the fourth approach (Strongly Supported Models), that actually treats disjunctions as in classical logic.\n                  <\/jats:p>","DOI":"10.1017\/s1471068425100185","type":"journal-article","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T06:05:28Z","timestamp":1756188328000},"page":"402-416","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Comparing Non-Minimal Semantics for Disjunction in Answer Set Programming"],"prefix":"10.1017","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4334-9267","authenticated-orcid":false,"given":"FELICIDAD","family":"AGUADO","sequence":"first","affiliation":[{"name":"University of A Coru\u00f1a"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7440-0953","authenticated-orcid":false,"given":"PEDRO","family":"CABALAR","sequence":"additional","affiliation":[{"name":"University of A Coru\u00f1a"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9817-6666","authenticated-orcid":false,"given":"BRAIS","family":"MU\u00d1IZ","sequence":"additional","affiliation":[{"name":"University of A Coru\u00f1a"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6269-6101","authenticated-orcid":false,"given":"GILBERTO","family":"P\u00c9REZ","sequence":"additional","affiliation":[{"name":"University of A Coru\u00f1a"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5561-6406","authenticated-orcid":false,"given":"CONCEPCI\u00d3N","family":"VIDAL","sequence":"additional","affiliation":[{"name":"University of A Coru\u00f1a"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2025,8,26]]},"reference":[{"key":"S1471068425100185_ref15","first-page":"169","volume-title":"Stable Models and an Alternative Logic Programming Paradigm","author":"Marek","year":"1999"},{"key":"S1471068425100185_ref6","first-page":"293","volume-title":"Logic and Databases","author":"Clark","year":"1978"},{"key":"S1471068425100185_ref4","volume-title":"Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP\u201923),","volume":"3437","author":"Cabalar","year":"2023"},{"key":"S1471068425100185_ref13","unstructured":"Heyting, A. 1930. Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie der Wissenschaften. Physikalisch-mathematische Klasse, 42\u201356."},{"key":"S1471068425100185_ref16","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116836"},{"key":"S1471068425100185_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.05.001"},{"key":"S1471068425100185_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.07.005"},{"key":"S1471068425100185_ref3","first-page":"886","volume-title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9\u201315 July 2016","author":"Alviano","year":"2016"},{"key":"S1471068425100185_ref8","first-page":"125","volume-title":"Stability, Supportedness, Minimality and Kleene Answer Set Programs","author":"Doherty","year":"2015"},{"key":"S1471068425100185_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)00106-G"},{"key":"S1471068425100185_ref7","first-page":"536","volume-title":"Logics in Artificial Intelligence - 15th European Conference, JELIA 2016, Larnaca, Cyprus, November 9\u201311, 2016, Proceedings","volume":"10021","author":"Doherty","year":"2016"},{"volume-title":"Logic Programming","year":"1992","author":"Lobo","key":"S1471068425100185_ref14"},{"key":"S1471068425100185_ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"S1471068425100185_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"S1471068425100185_ref22","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321991"},{"key":"S1471068425100185_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103712"},{"key":"S1471068425100185_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068424000048"},{"key":"S1471068425100185_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2019.103165"},{"key":"S1471068425100185_ref11","first-page":"1070","volume-title":"Proc. of the 5th International Conference on Logic Programming (ICLP\u201988)","author":"Gelfond","year":"1988"},{"key":"S1471068425100185_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01536399"},{"key":"S1471068425100185_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068425100185_ref18","first-page":"57","volume-title":"Proc. of Non-Monotonic Extensions of Logic Programming (NMELP\u201996)","author":"Pearce","year":"1996"}],"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\/S1471068425100185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T12:56:30Z","timestamp":1761310590000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068425100185\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["S1471068425100185"],"URL":"https:\/\/doi.org\/10.1017\/s1471068425100185","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2025,7]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. 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 (https:\/\/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"}]}}