{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,12]],"date-time":"2026-08-12T13:39:31Z","timestamp":1786541971002,"version":"3.56.0"},"reference-count":42,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T00:00:00Z","timestamp":1582675200000},"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":[[2020,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Epistemic logic programs (ELPs) are an extension of answer set programming (ASP) with epistemic operators that allow for a form of meta-reasoning, that is, reasoning over multiple possible worlds. Existing ELP solving approaches generally rely on making multiple calls to an ASP solver in order to evaluate the ELP. However, in this paper, we show that there also exists a direct translation from ELPs into non-ground ASP with bounded arity. The resulting ASP program can thus be solved in a single shot. We then implement this encoding method, using recently proposed techniques to handle large, non-ground ASP rules, into the prototype ELP solving system \u201cselp,\u201d which we present in this paper. This solver exhibits competitive performance on a set of ELP benchmark instances.<\/jats:p>","DOI":"10.1017\/s1471068420000022","type":"journal-article","created":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T09:49:46Z","timestamp":1582710586000},"page":"435-455","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":4,"title":["selp: <i>A Single-Shot Epistemic Logic Program Solver<\/i>"],"prefix":"10.1017","volume":"20","author":[{"given":"MANUEL","family":"BICHLER","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2077-7672","authenticated-orcid":false,"given":"MICHAEL","family":"MORAK","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"STEFAN","family":"WOLTRAN","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2020,2,26]]},"reference":[{"key":"S1471068420000022_ref21","unstructured":"Gebser, M. , Kaminski, R. , K\u00f6nig, A. and Schaub, T. 2011. Advances in gringo series 3. In Proceedings of LPNMR, 345\u2013351."},{"key":"S1471068420000022_ref20","first-page":"27","article-title":"Multi-shot ASP solving with clingo","volume":"1","author":"Gebser","year":"2019","journal-title":"TPLP 19"},{"key":"S1471068420000022_ref22","unstructured":"Gebser, M. , Kaufmann, B. and Schaub, T. 2009. Solution enumeration for projected boolean search problems. In Proceedings of CPAIOR, 71\u201386."},{"key":"S1471068420000022_ref26","unstructured":"Gelfond, M. 2011. New semantics for epistemic specifications. In Proceedings of LPNMR, 260\u2013265."},{"key":"S1471068420000022_ref33","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018978005636"},{"key":"S1471068420000022_ref19","unstructured":"Gebser, M. , Kaminski, R. , Kaufmann, B. and Schaub, T. 2014. clingo = ASP + control: Preliminary report. In ICLP Technical Communications"},{"key":"S1471068420000022_ref29","unstructured":"Kahl, P. T. 2014. Refining the semantics for epistemic logic programs. Ph.D. thesis, Texas Tech University, Texas, USA."},{"key":"S1471068420000022_ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012809"},{"key":"S1471068420000022_ref39","first-page":"1","article-title":"FLP answer set semantics without circular justifications for general logic programs","author":"Shen","year":"2014","journal-title":"Artificial Intelligence 213"},{"key":"S1471068420000022_ref2","unstructured":"Alviano, M. , Dodaro, C. , Faber, W. , Leone, N. and Ricca, F. 2013. WASP: A native ASP solver based on constraint learning. In Proc. LPNMR, 54\u201366."},{"key":"S1471068420000022_ref28","unstructured":"Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3\/4, 365\u2013386."},{"key":"S1471068420000022_ref31","unstructured":"Kahl, P. T. , 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, exv065."},{"key":"S1471068420000022_ref34","unstructured":"Morak, M. and Woltran, S. 2012. Preprocessing of complex non-ground rules in answer set programming. In ICLP Technical Communications, 247\u2013258."},{"key":"S1471068420000022_ref3","unstructured":"Bichler, M. , Morak, M. and Woltran, S. 2016a. lpopt: A rule optimization tool for answer set programming. In Proc. LOPSTR, 114\u2013130."},{"key":"S1471068420000022_ref40","unstructured":"Son, T. C. , Le, T. , Kahl, P. T. and Leclerc, A. P. 2017. On computing world views of epistemic logic programs. In Proc. IJCAI, 1269\u20131275."},{"key":"S1471068420000022_ref17","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.artint.2010.04.011","article-title":"Stable models and circumscription","volume":"1","author":"Ferraris","year":"2011","journal-title":"Artificial Intelligence 175"},{"key":"S1471068420000022_ref10","doi-asserted-by":"publisher","DOI":"10.3233\/IA-170104"},{"key":"S1471068420000022_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-008-9086-5"},{"key":"S1471068420000022_ref23","unstructured":"Gebser, M. , Kaufmann, B. and Schaub, T. 2012. Conflict-driven answer set solving: From theory to practice. Artificial Intelligence 187, 52\u201389."},{"key":"S1471068420000022_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530762"},{"key":"S1471068420000022_ref37","unstructured":"Pulina, L. 2016. The ninth QBF solvers evaluation \u2013 preliminary report. In Proc. QBF. CEUR Workshop Proceedings, vol. 1719. CEUR-WS.org, 1\u201313."},{"key":"S1471068420000022_ref18","doi-asserted-by":"publisher","DOI":"10.2200\/S00457ED1V01Y201211AIM019"},{"key":"S1471068420000022_ref7","unstructured":"Bliem, B. , Moldovan, M. , Morak, M. and Woltran, S. 2017. The impact of treewidth on ASP grounding and solving. In Proceedings of IJCAI, 852\u2013858."},{"key":"S1471068420000022_ref32","doi-asserted-by":"publisher","DOI":"10.29007\/xwzz"},{"key":"S1471068420000022_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28788-4"},{"key":"S1471068420000022_ref1","unstructured":"Abseher, M. , Musliu, N. and Woltran, S. 2017. htd - A free, open-source framework for (customized) tree decompositions and beyond. In Proc. CPAIOR, 376\u2013386."},{"key":"S1471068420000022_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.002"},{"key":"S1471068420000022_ref30","unstructured":"Kahl, P. T. , Leclerc, A. P. and Son, T. C. 2016. A parallel memory-efficient epistemic logic program solver: Harder, better, faster. In Proceedings of ASPOCP."},{"key":"S1471068420000022_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01536399"},{"key":"S1471068420000022_ref27","unstructured":"Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of ICLP\/SLP, 1070\u20131080."},{"key":"S1471068420000022_ref42","unstructured":"Zhang, Z. , Wang, B. and Zhang, S. 2015. Logic programming with graded introspection. In Proceedings of ASPOCP."},{"key":"S1471068420000022_ref5","unstructured":"Bichler, M. , Morak, M. and Woltran, S. 2018a. Single-shot epistemic logic program solving. In Proceedings of IJCAI, 1714\u20131720."},{"key":"S1471068420000022_ref4","first-page":"552","article-title":"The power of non-ground rules in answer set programming","volume":"5\u20136","author":"Bichler","year":"2016","journal-title":"TPLP 16"},{"key":"S1471068420000022_ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-006-9028-z"},{"key":"S1471068420000022_ref8","first-page":"1","article-title":"A tourist guide through treewidth","volume":"1\u20132","author":"Bodlaender","year":"1993","journal-title":"Acta Cybernetica 11"},{"key":"S1471068420000022_ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.04.004"},{"key":"S1471068420000022_ref6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/237"},{"key":"S1471068420000022_ref41","unstructured":"Truszczynski, M. 2011. Revisiting epistemic specifications. In Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning \u2013 Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday, 315\u2013333."},{"key":"S1471068420000022_ref36","first-page":"301","article-title":"Well-founded and stable semantics of logic programs with aggregates","volume":"3","author":"Pelov","year":"2007","journal-title":"TPLP 7"},{"key":"S1471068420000022_ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068420000022_ref24","unstructured":"Gelfond, M. 1991. Strong introspection. In Proc. AAAI, Vol. 1, 386\u2013391."},{"key":"S1471068420000022_ref11","unstructured":"del Cerro, L. F. , Herzig, A. and Su, E. I. 2015. Epistemic equilibrium logic. In Proceedings of IJCAI, 2964\u20132970."}],"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\/S1471068420000022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T09:31:36Z","timestamp":1612171896000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068420000022\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,26]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["S1471068420000022"],"URL":"https:\/\/doi.org\/10.1017\/s1471068420000022","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,26]]},"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"}},{"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"}]}}