{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T15:37:42Z","timestamp":1757777862866},"reference-count":15,"publisher":"Cambridge University Press (CUP)","issue":"3-4","license":[{"start":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T00:00:00Z","timestamp":1533859200000},"content-version":"unspecified","delay-in-days":40,"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":[[2018,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the construct of ordered disjunction, and CR-Prolog<jats:sub>2<\/jats:sub>is an extension of standard answer set programs with consistency restoring rules and LPOD-like ordered disjunction. We present reductions of each of these languages into the standard ASP language, which gives us an alternative way to understand the extensions in terms of the standard ASP language.<\/jats:p>","DOI":"10.1017\/s1471068418000315","type":"journal-article","created":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T09:44:17Z","timestamp":1533894257000},"page":"589-606","source":"Crossref","is-referenced-by-count":2,"title":["Translating LPOD and CR-Prolog<sub>2<\/sub>into standard answer set programs"],"prefix":"10.1017","volume":"18","author":[{"given":"JOOHYUNG","family":"LEE","sequence":"first","affiliation":[]},{"given":"ZHUN","family":"YANG","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2018,8,10]]},"reference":[{"key":"S1471068418000315_ref2","unstructured":"Balduccini M. , Balduccini M. , and Mellarkod V. 2003. CR-Prolog with ordered disjunction. In In ASP03 Answer Set Programming: Advances in Theory and Implementation, volume 78 of CEUR Workshop proceedings."},{"key":"S1471068418000315_ref5","unstructured":"Balduccini M. and Mellarkod V. 2004. A-Prolog with CR-rules and ordered disjunction. In Intelligent Sensing and Information Processing, 2004. Proceedings of International Conference on. IEEE, 1\u20136."},{"key":"S1471068418000315_ref6","unstructured":"Brewka G. 2002. Logic programming with ordered disjunction. In AAAI\/IAAI. 100\u2013105."},{"key":"S1471068418000315_ref15","doi-asserted-by":"crossref","unstructured":"Lee J. and Yang Z. 2018. Online appendix for the paper \u201cTranslating LPOD and CR-Prolog2 into standard answer set programs\".","DOI":"10.29007\/d8rl"},{"key":"S1471068418000315_ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068402001539"},{"key":"S1471068418000315_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45757-7_37"},{"key":"S1471068418000315_ref4","unstructured":"Balduccini M. and Gelfond M. 2003. Logic programs with consistency-restoring rules. In International Symposium on Logical Formalization of Commonsense Reasoning, AAAI 2003 Spring Symposium Series. 9\u201318."},{"key":"S1471068418000315_ref1","unstructured":"Asuncion V. , Zhang Y. , and Zhang H. 2014. Logic programs with ordered disjunction: first-order semantics and expressiveness. In Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning. AAAI Press, 2\u201311."},{"key":"S1471068418000315_ref3","doi-asserted-by":"crossref","unstructured":"Balduccini M. 2007. CR-MODELS: an inference engine for CR-Prolog. In Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning. Springer-Verlag, 18\u201330.","DOI":"10.1007\/978-3-540-72200-7_4"},{"key":"S1471068418000315_ref10","unstructured":"Calimeri F. , Faber W. , Gebser M. , Ianni G. , Kaminski R. , Krennwallner T. , Leone N. , Ricca F. , and Schaub T. 2012. ASP-Core-2: Input language format. ASP Standardization Working Group, Tech. Rep."},{"key":"S1471068418000315_ref8","doi-asserted-by":"crossref","unstructured":"Brewka G. , Delgrande J. P. , Romero J. , and Schaub T. 2015. asprin: Customizing answer set preferences without a headache. In AAAI. 1467\u20131474.","DOI":"10.1609\/aaai.v29i1.9398"},{"key":"S1471068418000315_ref13","unstructured":"Ferraris P. , Lee J. , Lifschitz V. , and Palla R. 2009. Symmetric splitting in the general theory of stable models. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI). 797\u2013803."},{"key":"S1471068418000315_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068418000315_ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1970398.1970401"},{"key":"S1471068418000315_ref7","first-page":"1","volume-title":"CAEPIA","author":"Brewka","year":"2005"}],"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\/S1471068418000315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:57:15Z","timestamp":1661734635000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068418000315\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":15,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["S1471068418000315"],"URL":"https:\/\/doi.org\/10.1017\/s1471068418000315","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}