{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T02:46:25Z","timestamp":1787453185765,"version":"build-2736575974"},"reference-count":19,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T00:00:00Z","timestamp":1600732800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2020,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set Programming system clingo. The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. The eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. This process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo \u2019s efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generally outperforms their obtained results.<\/jats:p>","DOI":"10.1017\/s1471068420000228","type":"journal-article","created":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T02:43:15Z","timestamp":1600742595000},"page":"834-847","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":12,"title":["eclingo : A Solver for Epistemic Logic Programs"],"prefix":"10.1017","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7440-0953","authenticated-orcid":false,"given":"Pedro","family":"Cabalar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3917-8717","authenticated-orcid":false,"given":"Jorge","family":"Fandinno","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javier","family":"Garea","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javier","family":"Romero","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7456-041X","authenticated-orcid":false,"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"S1471068420000228_ref12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","author":"Gelfond","year":"1991","journal-title":"New Generation Computing 9"},{"key":"S1471068420000228_ref15","unstructured":"15. Kelly, M. 2007. Wviews: A worldview solver for epistemic logic programs. Honour\u2019s thesis (supervised by Yan Zhang). University of Western Sydney."},{"key":"S1471068420000228_ref1","unstructured":"1. Balai, E. and Kahl, P. 2014. Epistemic logic programs with sorts. In Proceedings of the Workshop on Answer Set Programming and Other Computing Paradigms, 2014, Inclezan, D. and Maratea, M. , Eds."},{"key":"S1471068420000228_ref13","unstructured":"13. Gelfond, M. and Przymusinska, H. 1993. Reasoning on open domains. In Logic Programming and Non-monotonic Reasoning, Proceedings of the Second International Workshop, Lisbon, Portugal, June 1993, Moniz Pereira, L. and Nerode, A. , Eds. MIT Press, 397\u2013413."},{"key":"S1471068420000228_ref8","unstructured":"8. Gebser, M. , Kaminski, R. , Ostrowski, M. , Schaub, T. , and Thiele, S. 2009. On the input language of ASP grounder gringo. In Proceedings of the Tenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201909), Erdem, E. , Lin, F. , and Schaub, T. , Eds. Lecture Notes in Artificial Intelligence, vol. 5753. Springer-Verlag, 502\u2013508."},{"key":"S1471068420000228_ref4","unstructured":"4. Cabalar, P. , Fandinno, J. , and Fari\u00f1as del Cerro, L. 2019b. Splitting epistemic logic programs. See Balduccini et al. (2019), 120\u2013133."},{"key":"S1471068420000228_ref3","unstructured":"3. Cabalar, P. , Fandinno, J. , and Fari\u00f1as del Cerro, L. 2019a. Founded world views with autoepistemic equilibrium logic. See Balduccini et al. (2019), 134\u2013147."},{"key":"S1471068420000228_ref10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01530762","article-title":"Logic programming and reasoning with incomplete information","volume":"1","author":"Gelfond","year":"1994","journal-title":"Annals of Mathematics and Artificial Intelligence 12"},{"key":"S1471068420000228_ref5","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1017\/S1471068419000127","article-title":"Founded (auto)epistemic equilibrium logic satisfies epistemic splitting","volume":"5","author":"Fandinno","year":"2019","journal-title":"Theory and Practice of Logic Programming 19"},{"key":"S1471068420000228_ref17","unstructured":"17. Shen, Y. and Eiter, T. 2017. Evaluating epistemic negation in answer set programming (extended abstract). In Proceedings of the Twenty-sixth International Joint Conference on Artificial Intelligence (IJCAI\u201917), C. Sierra, Ed. IJCAI\/AAAI Press, 5060\u20135064."},{"key":"S1471068420000228_ref18","unstructured":"18. Son, T. C. , Le, T. , Kahl, P. T. , and Leclerc, A. P. 2017. On computing world views of epistemic logic programs. In Proc. of the 26th International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, C. Sierra, Ed. ijcai.org, 1269\u20131275."},{"key":"S1471068420000228_ref16","doi-asserted-by":"crossref","unstructured":"16. Leclerc, A. and Kahl, P. 2018. A survey of advances in epistemic logic program solvers. In Proceedings of the Eleventh International Workshop on Answer Set Programming and other Computer Paradigms (ASPOCP\u201918).","DOI":"10.29007\/xwzz"},{"key":"S1471068420000228_ref9","unstructured":"9. Gelfond, M. 1991. Strong introspection. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI\u201991), Dean, T. and McKeown, K. , Eds. AAAI Press\/The MIT Press, 386\u2013391."},{"key":"S1471068420000228_ref7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1017\/S1471068418000054","article-title":"Multi-shot ASP solving with clingo","volume":"1","author":"Gebser","year":"2019","journal-title":"Theory and Practice of Logic Programming 19"},{"key":"S1471068420000228_ref6","unstructured":"6. Fari\u00f1as del Cerro, L. , Herzig, A. , and Iraz Su, E. 2015. Epistemic equilibrium logic. In Proceedings of the Twenty-fourth International Joint Conference on Artificial Intelligence (IJCAI\u201915), Yang, Q. and Wooldridge, M. , Eds. AAAI Press, 2964\u20132970."},{"key":"S1471068420000228_ref2","doi-asserted-by":"crossref","unstructured":"2. Balduccini, M. , Lierler, Y. , and Woltran, S. , Eds. 2019. Proceedings of the Fifteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201919). Lecture Notes in Artificial Intelligence, vol. 11481. Springer-Verlag.","DOI":"10.1007\/978-3-030-20528-7"},{"key":"S1471068420000228_ref14","doi-asserted-by":"crossref","unstructured":"14. Kahl, P. , Watson, R. , Balai, E. , Gelfond, M. , and Zhang, Y. 2015. The language of epistemic specifications (refined) including a prototype solver. Journal of Logic and Computation.","DOI":"10.1093\/logcom\/exv065"},{"key":"S1471068420000228_ref11","unstructured":"11. Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of the Fifth International Conference and Symposium of Logic Programming (ICLP\u201988), Kowalski, R. and Bowen, K. , Eds. MIT Press, 1070\u20131080."},{"key":"S1471068420000228_ref19","volume-title":"Computer Science","volume":"6565","author":"Truszczynski","year":"2011"}],"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\/S1471068420000228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T10:59:41Z","timestamp":1603105181000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068420000228\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,22]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["S1471068420000228"],"URL":"https:\/\/doi.org\/10.1017\/s1471068420000228","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,22]]},"assertion":[{"value":"\u00a9 The Author(s), 2020. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}