{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:38:22Z","timestamp":1758044302837,"version":"3.44.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032048479","type":"print"},{"value":"9783032048486","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04848-6_3","type":"book-chapter","created":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T12:00:31Z","timestamp":1757678431000},"page":"40-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Implementing a\u00a0Many-Valued Semantics for\u00a0Logic Programs with\u00a0Ordered Disjunction Using ASP"],"prefix":"10.1007","author":[{"given":"Angelos","family":"Charalambidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Nikolaou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonis","family":"Troumpoukis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,9]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-61660-5_19","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2017","unstructured":"Alviano, M., Calimeri, F., Dodaro, C., Fusc\u00e0, D., Leone, N., Perri, S., Ricca, F., Veltri, P., Zangari, J.: The ASP system DLV2. In: Balduccini, M., Janhunen, T. (eds.) LPNMR 2017. LNCS (LNAI), vol. 10377, pp. 215\u2013221. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61660-5_19"},{"key":"3_CR2","unstructured":"Balduccini, M., Mellarkod, V.S.: Cr-prolog with ordered disjunction. In: Answer Set Programming, Advances in Theory and Implementation, Proceedings of the 2nd International ASP\u201903 Workshop, Messina, Italy, 26\u201328 September 2003. CEUR Workshop Proceedings, vol.\u00a078. CEUR-WS.org (2003)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/3-540-45757-7_37","volume-title":"Logics in Artificial Intelligence","author":"G Brewka","year":"2002","unstructured":"Brewka, G., Niemel\u00e4, I., Syrj\u00e4nen, T.: Implementing ordered disjunction using answer set solvers for normal programs. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 444\u2013456. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45757-7_37"},{"key":"3_CR4","unstructured":"Brewka, G.: Logic programming with ordered disjunction. In: AAAI\u201902, pp. 100\u2013105. AAAI Press\/The MIT Press (2002)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Brewka, G., Delgrande, J., Romero, J., Schaub, T.: asprin: Customizing answer set preferences without a headache. In: AAAI, vol. 29, no. 1 (2015)","DOI":"10.1609\/aaai.v29i1.9398"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1111\/j.0824-7935.2004.00241.x","volume":"20","author":"G Brewka","year":"2004","unstructured":"Brewka, G., Niemela, I., Syrjanen, T.: Logic programs with ordered disjunction. Comput. Intell. 20(2), 335\u2013357 (2004)","journal-title":"Comput. Intell."},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.3233\/AIC-2011-0494","volume":"24","author":"P Cabalar","year":"2011","unstructured":"Cabalar, P.: A logical characterisation of ordered disjunction. AI Commun. 24(2), 165\u2013175 (2011)","journal-title":"AI Commun."},{"issue":"5","key":"3_CR8","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1017\/S1471068422000242","volume":"22","author":"A Charalambidis","year":"2022","unstructured":"Charalambidis, A., Nomikos, C., Rondogiannis, P.: Strong equivalence of logic programs with ordered disjunction: a logical perspective. Theory Pract. Log. Program. 22(5), 708\u2013722 (2022)","journal-title":"Theory Pract. Log. Program."},{"issue":"5","key":"3_CR9","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1017\/S1471068421000235","volume":"21","author":"A Charalambidis","year":"2021","unstructured":"Charalambidis, A., Rondogiannis, P., Troumpoukis, A.: A logical characterization of the preferred models of logic programs with ordered disjunction. Theory Pract. Log. Program. 21(5), 629\u2013645 (2021)","journal-title":"Theory Pract. Log. Program."},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S1471068418000054","volume":"19","author":"M Gebser","year":"2019","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. Theory Pract. Log. Program. 19(1), 27\u201382 (2019)","journal-title":"Theory Pract. Log. Program."},{"issue":"3\/4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3\/4), 365\u2013386 (1991)","journal-title":"New Gener. Comput."},{"key":"3_CR12","unstructured":"K\u00e4rger, P., Lopes, N., Olmedilla, D., Polleres, A.: Towards logic programs with ordered and unordered disjunction. In: ASPOCP2008, ICLP 2008, pp. 46\u201360 (2008)"},{"key":"3_CR13","unstructured":"Lee, J., Yang, Z.: Computing logic programs with ordered disjunction using asprin. In: KR 2018, pp. 57\u201361. AAAI Press (2018)"},{"issue":"3\u20134","key":"3_CR14","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1017\/S1471068418000315","volume":"18","author":"J Lee","year":"2018","unstructured":"Lee, J., Yang, Z.: Translating LPOD and CR-Prolog2 into standard answer set programs. Theory Pract. Log. Program. 18(3\u20134), 589\u2013606 (2018)","journal-title":"Theory Pract. Log. Program."},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N Leone","year":"2006","unstructured":"Leone, N., et al.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/3-540-45402-0_38","volume-title":"Logic Programming and Nonmotonic Reasoning","author":"T Syrj\u00e4nen","year":"2001","unstructured":"Syrj\u00e4nen, T., Niemel\u00e4, I.: The smodels system. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 434\u2013438. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45402-0_38"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04848-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T12:00:33Z","timestamp":1757678433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04848-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,9]]},"ISBN":["9783032048479","9783032048486"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04848-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,9]]},"assertion":[{"value":"9 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lopstr.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}