{"type":"ScholarlyArticle","title":"Single-Shot Epistemic Logic Program Solving","authors":[{"name":"Manuel Bichler","slug":"manuel-bichler","given":"Manuel","family":"Bichler","affiliation":"TU Wien , Vienna , Austria"},{"name":"Michael Morak","slug":"michael-morak","given":"Michael","family":"Morak","affiliation":"TU Wien , Vienna , Austria"},{"name":"Stefan Woltran","slug":"stefan-woltran","given":"Stefan","family":"Woltran","affiliation":"TU Wien , Vienna , Austria"}],"abstract":"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 a prototype ELP solving system. This solver exhibits competitive performance on a set of ELP benchmark instances.","doi":"10.24963/ijcai.2018/237","url":"https://ijcai.org/proceedings/2018/237","pdf":"https://ijcai.org/proceedings/2018/0237.pdf","markdown":"https://ijcai.org/proceedings/2018/237.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/237","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":237,"pages":{"first":1714,"last":1720},"keywords":["Knowledge Representation and Reasoning: Logics for Knowledge Representation","Knowledge Representation and Reasoning: Non-monotonic Reasoning","Knowledge Representation and Reasoning: Automated Reasoning and Theorem Proving"],"videos":[],"references":[{"position":1,"raw":"[Abseher et al., 2017] Michael Abseher, Nysret Musliu, and Stefan Woltran. htd -A free, open-source framework for (customized) tree decompositions and beyond. In Proc. CPAIOR, pages 376-386, 2017.","title":"htd -A free, open-source framework for (customized) tree decompositions and beyond","authors":"Michael Abseher, Nysret Musliu, Stefan Woltran","year":"2017","venue":"Proc. CPAIOR","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alviano et al., 2013] Mario Alviano, Carmine Dodaro, Wolfgang Faber, Nicola Leone, and Francesco Ricca. WASP: A native ASP solver based on constraint learning. In Proc. LPNMR, pages 54-66, 2013.","title":"WASP: A native ASP solver based on constraint learning","authors":"Mario Alviano, Carmine Dodaro, Wolfgang Faber, Nicola Leone, Francesco Ricca","year":"2013","venue":"Proc. LPNMR","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bichler et al., 2016a] Manuel Bichler, Michael Morak, and Stefan Woltran. lpopt: A rule optimization tool for an- swer set programming. In Proc. LOPSTR, pages 114-130, 2016.","title":"lpopt: A rule optimization tool for answer set programming","authors":"Bichler","year":"2016","venue":"Proc. LOPSTR","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bichler et al., 2016b] Manuel Bichler, Michael Morak, and Stefan Woltran. The power of non-ground rules in answer set programming. TPLP, 16(5-6):552-569, 2016.","title":"The power of non-ground rules in answer set programming","authors":"Bichler","year":"2016","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bodlaender, 1993] Hans L. Bodlaender. A tourist guide through treewidth. Acta Cybern., 11(1-2):1-21, 1993.","title":"A tourist guide through treewidth","authors":"L Hans, Bodlaender","year":"1993","venue":"Acta Cybern","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Brewka et al., 2011] Gerhard Brewka, Thomas Eiter, and Miroslaw Truszczynski. Answer set programming at a glance. Commun. ACM, 54(12):92-103, 2011.","title":"Answer set programming at a glance","authors":"Gerhard Brewka, Thomas Eiter, Miroslaw Truszczynski","year":"2011","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[del Cerro et al., 2015] Luis Fariñas del Cerro, Andreas Herzig, and Ezgi Iraz Su. Epistemic equilibrium logic. In Proc. IJCAI, pages 2964-2970, 2015.","title":"Epistemic equilibrium logic","authors":"Del Cerro","year":"2015","venue":null,"doi":null,"url":null,"internal_url":"/proceedings/2015/419"},{"position":8,"raw":"[Eiter and Gottlob, 1995] Thomas Eiter and Georg Gottlob. On the computational cost of disjunctive logic program- ming: Propositional case. Ann. Math. Artif. Intell., 15(3- 4):289-323, 1995.","title":"On the computational cost of disjunctive logic programming: Propositional case","authors":"Thomas Eiter, Georg Gottlob","year":"1995","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Eiter et al., 2007] Thomas Eiter, Wolfgang Faber, Michael Fink, and Stefan Woltran. Complexity results for answer set programming with bounded predicate arities and impli- cations. Ann. Math. Artif. Intell., 51(2-4):123-165, 2007.","title":"Complexity results for answer set programming with bounded predicate arities and implications","authors":"Thomas Eiter, Wolfgang Faber, Michael Fink, Stefan Woltran","year":"2007","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Faber et al., 2011] Wolfgang Faber, Gerald Pfeifer, and Nicola Leone. Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell., 175(1):278-298, 2011.","title":"Semantics and complexity of recursive aggregates in answer set programming","authors":"Faber","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Ferraris et al., 2011] Paolo Ferraris, Joohyung Lee, and Vladimir Lifschitz. Stable models and circumscription. Artif. Intell., 175(1):236-263, 2011.","title":"Stable models and circumscription","authors":"Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Gebser et al., 2011] Martin Gebser, Roland Kaminski, Arne König, and Torsten Schaub. Advances in gringo series 3. In Proc. LPNMR, pages 345-351, 2011.","title":"Advances in gringo series 3","authors":"Martin Gebser, Roland Kaminski, Arne König, Torsten Schaub","year":"2011","venue":"Proc. LPNMR","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gebser et al., 2012a] Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub. Answer Set Solving in Practice. Morgan & Claypool, 2012.","title":"Answer Set Solving in Practice","authors":"Gebser","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gebser et al., 2012b] Martin Gebser, Benjamin Kaufmann, and Torsten Schaub. Conflict-driven answer set solving: From theory to practice. Artif. Intell., 187:52-89, 2012.","title":"Conflict-driven answer set solving: From theory to practice","authors":"Gebser","year":"2012","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gebser et al., 2014] Martin Gebser, Roland Kaminski, Ben- jamin Kaufmann, and Torsten Schaub. clingo = ASP + control: Preliminary report. In ICLP Tech.Comm., 2014.","title":"clingo = ASP + control: Preliminary report","authors":"Gebser","year":"2014","venue":"ICLP Tech.Comm","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gelfond and Lifschitz, 1988] Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Proc. ICLP/SLP, pages 1070-1080, 1988.","title":"The stable model semantics for logic programming","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1988","venue":"Proc. ICLP/SLP","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gelfond and Lifschitz, 1991] Michael Gelfond and Vladimir Lifschitz. Classical negation in logic pro- grams and disjunctive databases. New Generation Comput., 9(3/4):365-386, 1991.","title":"Classical negation in logic programs and disjunctive databases","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1991","venue":"New Generation Comput","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Gelfond, 1991] Michael Gelfond. Strong introspection. In Proc. AAAI, Volume 1, pages 386-391, 1991.","title":"Strong introspection","authors":"Michael Gelfond","year":"1991","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Gelfond, 1994] Michael Gelfond. Logic programming and reasoning with incomplete information. Ann. Math. Artif. Intell., 12(1-2):89-116, 1994.","title":"Logic programming and reasoning with incomplete information","authors":"Michael Gelfond","year":"1994","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Gelfond, 2011] Michael Gelfond. New semantics for epis- temic specifications. In Proc. LPNMR, pages 260-265, 2011.","title":"New semantics for epistemic specifications","authors":"Michael Gelfond","year":"2011","venue":"Proc. LPNMR","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Kahl et al., 2015] Patrick Thor Kahl, Richard Watson, Ev- genii Balai, Michael Gelfond, and Yuanlin Zhang. The language of epistemic specifications (refined) including a prototype solver. J. Log. Comput., 25, 2015.","title":"The language of epistemic specifications (refined) including a prototype solver","authors":"Thor Patrick, Richard Kahl, Evgenii Watson, Michael Balai, Yuanlin Gelfond, Zhang","year":"2015","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Kahl, 2014] Patrick Thor Kahl. Refining the Semantics for Epistemic Logic Programs. PhD thesis, Texas Tech Uni- versity, Texas, USA, 2014.","title":"Refining the Semantics for Epistemic Logic Programs","authors":"; Kahl, Thor Patrick, Kahl","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lifschitz et al., 1999] Vladimir Lifschitz, Lappoon R. Tang, and Hudson Turner. Nested expressions in logic programs. Ann. Math. Artif. Intell., 25(3-4):369-389, 1999.","title":"Nested expressions in logic programs","authors":"Vladimir Lifschitz, Lappoon R Tang, Hudson Turner","year":"1999","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Pearce, 2006] David Pearce. Equilibrium logic. Ann. Math. Artif. Intell., 47(1-2):3-41, 2006.","title":"Equilibrium logic","authors":"David Pearce","year":"2006","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Pelov et al., 2007] Nikolay Pelov, Marc Denecker, and Maurice Bruynooghe. Well-founded and stable semantics of logic programs with aggregates. TPLP, 7(3):301-353, 2007.","title":"Well-founded and stable semantics of logic programs with aggregates","authors":"Nikolay Pelov, Marc Denecker, Maurice Bruynooghe","year":"2007","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Pulina, 2016] Luca Pulina. The ninth QBF solvers evalua- tion -preliminary report. In Proc. QBF, 2016.","title":"The ninth QBF solvers evaluation -preliminary report","authors":"Luca Pulina","year":"2016","venue":"Proc. QBF","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Shen and Eiter, 2016] Yi-Dong Shen and Thomas Eiter. Evaluating epistemic negation in answer set programming. Artif. Intell., 237:115-135, 2016.","title":"Evaluating epistemic negation in answer set programming","authors":"Yi-Dong Shen, Thomas Eiter","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Shen et al., 2014] Yi-Dong Shen, Kewen Wang, Thomas Eiter, Michael Fink, Christoph Redl, Thomas Krennwall- ner, and Jun Deng. FLP answer set semantics without cir- cular justifications for general logic programs. Artif. In- tell., 213:1-41, 2014.","title":"FLP answer set semantics without circular justifications for general logic programs","authors":"Yi-Dong Shen, Kewen Wang, Thomas Eiter, Michael Fink, Christoph Redl, Thomas Krennwallner, Jun Deng","year":"2014","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Son et al., 2017] Tran Cao Son, Tiep Le, Patrick Thor Kahl, and Anthony P. Leclerc. On computing world views of epistemic logic programs. In Proc. IJCAI, pages 1269-1275, 2017.","title":"On computing world views of epistemic logic programs","authors":"Tran Cao, Son, Tiep Le, Patrick, Thor Kahl, Anthony P Leclerc","year":"2017","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/176"},{"position":30,"raw":"[Truszczynski, 2011] Miroslaw Truszczynski. Revisiting epistemic specifications. In Logic Programming, Knowl- edge Representation, and Nonmonotonic Reasoning -Es- says Dedicated to Michael Gelfond on the Occasion of His 65th Birthday, 2011.","title":"Revisiting epistemic specifications","authors":"Miroslaw Truszczynski","year":"2011","venue":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning -Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}