{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T16:36:01Z","timestamp":1757781361580,"version":"3.40.5"},"reference-count":14,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2021,9,23]],"date-time":"2021-09-23T00:00:00Z","timestamp":1632355200000},"content-version":"unspecified","delay-in-days":22,"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":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Logic programs with ordered disjunction (LPODs) extend classical logic programs with the capability of expressing alternatives with decreasing degrees of preference in the heads of program rules. Despite the fact that the operational meaning of ordered disjunction is clear, there exists an important open issue regarding its semantics. In particular, there does not exist a <jats:italic>purely model-theoretic<\/jats:italic> approach for determining the <jats:italic>most preferred models<\/jats:italic> of an LPOD. At present, the selection of the most preferred models is performed using a technique that is not based exclusively on the models of the program and in certain cases produces counterintuitive results. We provide a novel, model-theoretic semantics for LPODs, which uses an additional truth value in order to identify the most preferred models of a program. We demonstrate that the proposed approach overcomes the shortcomings of the traditional semantics of LPODs. Moreover, the new approach can be used to define the semantics of a natural class of logic programs that can have both ordered and classical disjunctions in the heads of clauses. This allows programs that can express not only strict levels of preferences but also alternatives that are equally preferred.<\/jats:p>","DOI":"10.1017\/s1471068421000235","type":"journal-article","created":{"date-parts":[[2021,9,23]],"date-time":"2021-09-23T08:27:20Z","timestamp":1632385640000},"page":"629-645","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":5,"title":["A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction"],"prefix":"10.1017","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7437-410X","authenticated-orcid":false,"given":"ANGELOS","family":"CHARALAMBIDIS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PANOS","family":"RONDOGIANNIS","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANTONIS","family":"TROUMPOUKIS","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2021,9,23]]},"reference":[{"key":"S1471068421000235_ref7","unstructured":"Faber, W. , Tompits, H. and Woltran, S. 2008. Notions of strong equivalence for logic programs with ordered disjunction. In Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, KR 2008, Sydney, Australia, September 16-19, 2008, Brewka, G. and Lang, J. , Eds. AAAI Press, 433\u2013443."},{"key":"S1471068421000235_ref11","doi-asserted-by":"publisher","DOI":"10.1145\/383779.383783"},{"key":"S1471068421000235_ref13","doi-asserted-by":"crossref","unstructured":"Pearce, D. 1996. A new logical characterisation of stable models and answer sets. In Non-Monotonic Extensions of Logic Programming, NMELP 1996, Bad Honnef, Germany, September 5\u20136, 1996, Selected Papers. Lecture Notes in Computer Science, vol. 1216. Springer, 57\u201370.","DOI":"10.1007\/BFb0023801"},{"key":"S1471068421000235_ref8","doi-asserted-by":"crossref","unstructured":"Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3\/4, 365\u2013386.","DOI":"10.1007\/BF03037169"},{"key":"S1471068421000235_ref6","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-2011-0494"},{"key":"S1471068421000235_ref10","unstructured":"K\u00e4rger, P. , Lopes, N. , Olmedilla, D. and Polleres, A. 2008. Towards logic programs with ordered and unordered disjunction. In Proceedings of Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP2008), 24th International Conference on Logic Programming (ICLP 2008). 46\u201360."},{"key":"S1471068421000235_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.006"},{"key":"S1471068421000235_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068419000267"},{"key":"S1471068421000235_ref14","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321991"},{"key":"S1471068421000235_ref2","unstructured":"Balduccini, M. and Mellarkod, V. S. 2003. Cr-prolog with ordered disjunction. In Answer Set Programming, Advances in Theory and Implementation, Proceedings of the 2nd Intl. ASP 2003 Workshop, Messina, Italy, September 26\u201328, 2003. CEUR Workshop Proceedings, vol. 78. CEUR-WS.org."},{"key":"S1471068421000235_ref3","unstructured":"Brewka, G. 2002. Logic programming with ordered disjunction. In Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28 \u2013 August 1, 2002, Edmonton, Alberta, Canada. AAAI Press\/The MIT Press, 100\u2013105."},{"key":"S1471068421000235_ref9","first-page":"42","article-title":"Die formalen regeln der intuitionistischen logik","volume":"II","author":"Heyting","year":"1930","journal-title":"Sitzungsbericht PreuBische Akademie der Wissenschaften Berlin, physikalisch-mathematische Klasse"},{"key":"S1471068421000235_ref12","doi-asserted-by":"publisher","DOI":"10.2307\/2268973"},{"key":"S1471068421000235_ref5","doi-asserted-by":"publisher","DOI":"10.1111\/j.0824-7935.2004.00241.x"}],"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\/S1471068421000235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T09:17:00Z","timestamp":1637227020000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068421000235\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["S1471068421000235"],"URL":"https:\/\/doi.org\/10.1017\/s1471068421000235","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"\u00a9 The Author(s), 2021. 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 in any medium, provided the original work 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"}]}}