{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T01:30:59Z","timestamp":1785202259837,"version":"3.55.0"},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T00:00:00Z","timestamp":1707091200000},"content-version":"unspecified","delay-in-days":0,"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":[[2024,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Epistemic logic programs (ELPs), extend answer set programming (ASP) with epistemic operators. The semantics of such programs is provided in terms of <jats:italic>world views<\/jats:italic>, which are sets of belief sets, that is, syntactically, sets of sets of atoms. Different semantic approaches propose different characterizations of world views. Recent work has introduced semantic properties that should be met by any semantics for ELPs, like the <jats:italic>Epistemic Splitting Property<\/jats:italic>, that, if satisfied, allows to modularly compute world views in a bottom-up fashion, analogously to \u201ctraditional\u201d ASP. We analyze the possibility of changing the perspective, shifting from a bottom-up to a top-down approach to splitting. We propose a basic top-down approach, which we prove to be equivalent to the bottom-up one. We then propose an extended approach, where our new definition: (i) is provably applicable to many of the existing semantics; (ii) operates similarly to \u201ctraditional\u201d ASP; (iii) provably coincides under any semantics with the bottom-up notion of splitting at least on the class of <jats:italic>Epistemically Stratified Programs<\/jats:italic> (which are, intuitively, those where the use of epistemic operators is stratified); (iv) better adheres to common ASP programming methodology.<\/jats:p>","DOI":"10.1017\/s1471068424000012","type":"journal-article","created":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T07:19:54Z","timestamp":1707117594000},"page":"482-504","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":2,"title":["Epistemic Logic Programs: A Study of Some Properties"],"prefix":"10.1017","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5686-6124","authenticated-orcid":false,"given":"STEFANIA","family":"COSTANTINI","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6755-9314","authenticated-orcid":false,"given":"ANDREA","family":"FORMISANO","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2024,2,5]]},"reference":[{"key":"S1471068424000012_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530762"},{"key":"S1471068424000012_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8"},{"key":"S1471068424000012_ref3","doi-asserted-by":"crossref","unstructured":"Costantini, S. 2002. Meta-reasoning: A survey. In Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II, A. C. Kakas and F. Sadri, Eds. Lecture Notes in Computer Science, vol. 2408. Springer, 253\u2013288.","DOI":"10.1007\/3-540-45632-5_11"},{"key":"S1471068424000012_ref4","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068405002589"},{"key":"S1471068424000012_ref15","unstructured":"Gelfond, M. and Przymusinska, H. 1991. Definitions in epistemic specifications. In Proceedings of the 1st International Workshop on Logic Programming and Non-monotonic Reasoning, A. Nerode, V. W. Marek, and V. S. Subrahmanian, Eds. The MIT Press, 245\u2013259."},{"key":"S1471068424000012_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841900019X"},{"key":"S1471068424000012_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.04.004"},{"key":"S1471068424000012_ref11","unstructured":"Fari\u00f1as del Cerro, L. , Herzig, A. and Su, E. I. 2015. Epistemic equilibrium logic. In Proceedings of IJCAI 2015, Q. Yang and M. Wooldridge, Eds. AAAI Press, 2964\u20132970."},{"key":"S1471068424000012_ref26","doi-asserted-by":"crossref","unstructured":"Truszczynski, M. 2011. Revisiting epistemic specifications. In Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, Balduccini, M. and Son, T. C. , Eds. LNCS, vol. 6565. Springer, 315\u2013333.","DOI":"10.1007\/978-3-642-20832-4_20"},{"key":"S1471068424000012_ref23","first-page":"1","article-title":"Constraint monotonicity, epistemic splitting and foundedness are too strong in answer set programming","author":"Shen","year":"2020","journal-title":"CoRR abs\/2010.00191"},{"key":"S1471068424000012_ref24","doi-asserted-by":"crossref","unstructured":"Su, E. I. 2019. Epistemic answer set programming. In Proceedings of JELIA\u201919, Calimeri, F. , Leone, N. , and Manna, M. , Eds. LNCS, vol. 11468. Springer, 608\u2013626.","DOI":"10.1007\/978-3-030-19570-0_40"},{"key":"S1471068424000012_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000058"},{"key":"S1471068424000012_ref9","doi-asserted-by":"publisher","DOI":"10.3233\/FI-1995-2233"},{"key":"S1471068424000012_ref16","first-page":"953","article-title":"The language of epistemic specifications (refined) including a prototype solver","volume":"4","author":"Kahl","year":"2015","journal-title":"Journal of Logic and Computation 30"},{"key":"S1471068424000012_ref25","doi-asserted-by":"crossref","unstructured":"Su, E. I. 2021. Refining the semantics of epistemic specifications. In Proceedings 37th International Conference on Logic Programming (Technical Communications), ICLP Technical Communications 2021, Porto (virtual event), 20-27th September 2021, A. Formisano, Y. A. Liu, B. Bogaerts, A. Brik, V. Dahl, C. Dodaro, P. Fodor, G. L. Pozzato, J. Vennekens, and N. Zhou, Eds. Electronic Proceedings in Theoretical Computer Science, vol. 345. EPTCS, 113\u2013126.","DOI":"10.4204\/EPTCS.345.0"},{"key":"S1471068424000012_ref14","unstructured":"Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proc. of the 5th International Conference and Sympoxium on Logic Programming, R. Kowalski and K. Bowen, Eds. Press, MIT , 1070\u20131080."},{"key":"S1471068424000012_ref17","unstructured":"Kahl, P. T. and Leclerc, A. P. 2018. Epistemic logic programs with world view constraints. In Technical Communications of the ICLP 2018, Pal\u00f9, A. D. , Tarau, P. , Saeedloei, N. , and Fodor, P. , Eds. OASIcs, vol. 64. Schloss Dagstuhl, 1:1\u20131:17."},{"key":"S1471068424000012_ref8","unstructured":"Costantini, S. and Formisano, A. 2022. Epistemic logic programs: a novel perspective and some extensions. In Proceedings of the International Conference on Logic Programming 2022 Workshops co-located with the 38th International Conference on Logic Programming (ICLP) 2022, Haifa, Israel, July 31st \u2013 August 1st, 2022, J. Arias, R. Calegari, L. Dickens, W. Faber, J. Fandinno, G. Gupta, M. Hecher, D. Inclezan, E. LeBlanc, M. Morak, E. Salazar, and J. Zangari, Eds. Workshop Proceedings, CEUR , vol. 3193. CEUR-WS.org."},{"key":"S1471068424000012_ref18","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2630"},{"key":"S1471068424000012_ref2","doi-asserted-by":"crossref","unstructured":"Cabalar, P. , Fandinno, J. and Fari\u00f1as del Cerro, L. 2019. Splitting epistemic logic programs. In Proceedings of LPNMR\u201919, M. Balduccini, Y. Lierler, and S. Woltran, Eds. Lecture Notes in Computer Science, vol. 11481. Springer, 120\u2013133.","DOI":"10.1007\/978-3-030-20528-7_10"},{"key":"S1471068424000012_ref19","doi-asserted-by":"crossref","unstructured":"Lifschitz, V. 2010. Thirteen definitions of a stable model. In Fields of Logic and Computation, Blass, A. , Dershowitz, N. , and Reisig, W. , Eds. LNCS, vol. 6300. Springer, 488\u2013503.","DOI":"10.1007\/978-3-642-15025-8_24"},{"key":"S1471068424000012_ref13","doi-asserted-by":"crossref","unstructured":"Gelfond, M. 2011. New semantics for epistemic specifications. In Proceedings of LPNMR\u201911, Delgrande, J. P. and Faber, W. , Eds. LNCS, vol. 6645. Springer, 260\u2013265.","DOI":"10.1007\/978-3-642-20895-9_29"},{"key":"S1471068424000012_ref20","unstructured":"Lifschitz, V. and Turner, H. 1994. Splitting a logic program. In Proceedings of ICLP\u201994. MIT Press, 23\u201337."},{"key":"S1471068424000012_ref7","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2021-2051"},{"key":"S1471068424000012_ref10","doi-asserted-by":"publisher","DOI":"10.1017\/S147106842100048X"},{"key":"S1471068424000012_ref6","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2015-1255"}],"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\/S1471068424000012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T13:02:55Z","timestamp":1728565375000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068424000012\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,5]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["S1471068424000012"],"URL":"https:\/\/doi.org\/10.1017\/s1471068424000012","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,5]]},"assertion":[{"value":"\u00a9 The Author(s), 2024. 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, 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"}]}}