{"type":"ScholarlyArticle","title":"On Computing World Views of Epistemic Logic Programs","authors":[{"name":"Tran Cao Son","slug":"tran-cao-son","given":"Tran Cao","family":"Son","affiliation":"Department of Computer Science New Mexico State University Las Cruces , NM 88003 , USA"},{"name":"Tiep Le","slug":"tiep-le","given":"Tiep","family":"Le","affiliation":"Department of Computer Science New Mexico State University Las Cruces , NM 88003 , USA"},{"name":"Patrick Kahl","slug":"patrick-kahl","given":"Patrick","family":"Kahl","affiliation":"SPAWAR Atlantic North Charleston , SC 29410 , USA"},{"name":"Anthony Leclerc","slug":"anthony-leclerc","given":"Anthony","family":"Leclerc","affiliation":"SPAWAR Atlantic North Charleston , SC 29410 , USA"}],"abstract":"This paper presents a novel algorithm for computing world views of different semantics of epistemic logic  programs (ELP) and two of its realization, called Ep-asp (for an older semantics) and Ep-asp^{se}  (for the newest semantics), whose implementation builds on the theoretical advancement in the study of ELPs and takes advantage of the multi-shot computation paradigm of the answer set solver Clingo. The new algorithm differs from the majority of earlier algorithms in its strategy. Specifically, it computes one world view at a time and utilizes properties of world views to reduce its search space. It starts by computing an answer set and then determines whether or not a world view containing this answer set exists. In addition, it allows for the computation to focus on world views satisfying certain properties. The paper includes an experimental analysis of the performance of the two solvers comparing against  a recently developed solver. It also contains an analysis of their performance in goal directed computing against a logic programming based conformant planning system,   dlv-k. It concludes with some final remarks and discussion on the future work.","doi":"10.24963/ijcai.2017/176","url":"https://ijcai.org/proceedings/2017/176","pdf":"https://ijcai.org/proceedings/2017/0176.pdf","markdown":"https://ijcai.org/proceedings/2017/176.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/176","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":176,"pages":{"first":1269,"last":1275},"keywords":["Knowledge Representation, Reasoning, and Logic: Knowledge Representation Languages","Constraints and Satisfiability: Solvers and Tools"],"videos":[],"references":[{"position":1,"raw":"[Balai and Kahl, 2014] Evgenii Balai and Patrick Kahl. Epistemic logic programs with sorts. In Daniela Inclezan and Marco Maratea, editors, ASPOCP 2014, 2014.","title":"Epistemic logic programs with sorts","authors":"Kahl Balai, Evgenii Balai, Patrick Kahl","year":"2014","venue":"ASPOCP 2014","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[del Cerro et al., 2015] Luis Farinas del Cerro, Andreas Herzig, and Ezgi Iraz Su. Epistemic equilibrium logic. In Qiang Yang and Michael Wooldridge, editors, IJCAI 2015. AAAI Press / IJCAI, 2015.","title":"Epistemic equilibrium logic","authors":"Del Cerro","year":"2015","venue":"IJCAI 2015","doi":null,"url":null,"internal_url":"/proceedings/2015/419"},{"position":3,"raw":"[Eiter et al., 2003] Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, and Axel Polleres. A logic pro- gramming approach to knowledge-state planning, II: the dlv k system. Artif. Intell., 144(1-2):157-211, 2003.","title":"A logic programming approach to knowledge-state planning, II: the dlv k system","authors":"Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres","year":"2003","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Gebser et al., 2014] Martin Gebser, Roland Kaminski, Ben- jamin Kaufmann, and Torsten Schaub. Clingo = ASP + control: Preliminary report. CoRR, abs/1405.3694, 2014.","title":"Clingo = ASP + control: Preliminary report","authors":"Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Gelfond and Lifschitz, 1991] Michael Gelfond and Vladimir Lifschitz. Classical negation in logic pro- grams and disjunctive databases. New Generation Computing, 9(3/4):365-385, 1991.","title":"Classical negation in logic programs and disjunctive databases","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1991","venue":"New Generation Computing","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Gelfond, 1991] Michael Gelfond. Strong introspection. In Thomas L. Dean and Kathleen McKeown, editors, AAAI- 91, volume 1, pages 386-391. AAAI Press / The MIT Press, 1991.","title":"Strong introspection","authors":"Michael Gelfond","year":"1991","venue":"AAAI-91","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gelfond, 1994] Michael Gelfond. Logic programming and reasoning with incomplete information. Annals of Mathe- matics and Artificial Intelligence, 12(1-2):89-116, 1994.","title":"Logic programming and reasoning with incomplete information","authors":"Michael Gelfond","year":"1994","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Hanks and McDermott, 1987] Steve Hanks and Drew Mc- Dermott. Nonmonotonic logic and temporal projection. Artificial Intelligence, 33(3):379-412, November 1987.","title":"Nonmonotonic logic and temporal projection","authors":"Mcdermott Hanks, Steve Hanks, Drew Mc-Dermott","year":"1987","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Kahl et al., 2015] Patrick Kahl, Richard Watson, Evgenii Balai, Michael Gelfond, and Yuanlin Zhang. The language of epistemic specifications (refined) including a prototype solver. Journal of Logic and Computation, 2015.","title":"The language of epistemic specifications (refined) including a prototype solver","authors":"Patrick Kahl, Richard Watson, Evgenii Balai, Michael Gelfond, Yuanlin Zhang","year":"2015","venue":"Journal of Logic and Computation","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Kahl et al., 2016] Patrick T. Kahl, Anthony P. Leclerc, and Tran Cao Son. A parallel memory-efficient epistemic logic program solver: Harder, better, faster. In ASPOCP, 2016.","title":"A parallel memory-efficient epistemic logic program solver: Harder, better, faster","authors":"Patrick T Kahl, Anthony P Leclerc, Tran Cao, Son","year":"2016","venue":"ASPOCP","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Kelly, 2007] Michael Kelly. Wviews: A worldview solver for epistemic logic programs. Honour's thesis, University of Western Sydney, 2007.","title":"Wviews: A worldview solver for epistemic logic programs","authors":"Michael Kelly","year":"2007","venue":"Honour's thesis","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Kurien et al., 2002] James Kurien, P. Pandurang Nayak, and David E. Smith. Fragment-based conformant planning. In AIPS, pages 153-162, 2002.","title":"Fragment-based conformant planning","authors":"P Pandurang James Kurien, David E Nayak, Smith","year":"2002","venue":"AIPS","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Lifschitz and Turner, 1994] V. Lifschitz and H. Turner. Splitting a logic program. In Pascal Van Hentenryck, editor, Proceedings of the Eleventh International Confer- ence on Logic Programming, pages 23-38, 1994.","title":"Splitting a logic program","authors":"V Lifschitz, H Turner","year":"1994","venue":"Proceedings of the Eleventh International Conference on Logic Programming","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Lifschitz et al., 1999] Vladimir Lifschitz, Lappoon R. Tang, and Hudson Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369- 389, 1999.","title":"Nested expressions in logic programs","authors":"Vladimir Lifschitz, Lappoon R Tang, Hudson Turner","year":"1999","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Nguyen et al., 2012] H-K. Nguyen, D-V. Tran, T.C. Son, and E. Pontelli. On computing conformant plans using classical planners: A generate-and-complete approach. In Proceedings of the 22st International Conference on Auto- mated Planning and Scheduling, ICAPS 2012,Atibaia, Sao Paulo Brazil, June 25-29. AAAI Press, 2012.","title":"On computing conformant plans using classical planners: A generate-and-complete approach","authors":"H-K Nguyen, D-V. Tran, T C Son, E Pontelli","year":"2012","venue":"Proceedings of the 22st International Conference on Automated Planning and Scheduling, ICAPS 2012","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Reichgelt, 1987] Han Reichgelt. A review of mcdermott's \"critique of pure reason\". AI Commun., 0(1):39-42, 1987.","title":"Han Reichgelt. A review of mcdermott's \"critique of pure reason","authors":"Reichgelt","year":"1987","venue":"AI Commun","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Shen and Eiter, 2016] Yi-Dong Shen and Thomas Eiter. Evaluating epistemic negation in answer set programming. Artificial Intelligence, 237:115-135, 2016.","title":"Evaluating epistemic negation in answer set programming","authors":"Eiter ; ] Yi-Dong Shen, Thomas Shen, Eiter","year":"2016","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Truszczyński, 2011] Miroslaw Truszczyński. Revisiting epistemic specifications. In Marcello Balduccini and Tran Cao Son, editors, Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, volume 6565 of Lecture Notes in Computer Science, pages 315- 333. Springer, 2011.","title":"Revisiting epistemic specifications","authors":"Miroslaw Truszczyński","year":"2011","venue":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Zhang and Zhao, 2014] Zhizheng Zhang and Kaikai Zhao. ESmodels: An epistemic specification solver. CoRR, abs/1405.3486, 2014.","title":"ESmodels: An epistemic specification solver","authors":"Zhao ; ] Zhizheng Zhang, Kaikai Zhang, Zhao","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Zhang, 2006] Yan Zhang. Computational properties of epis- temic logic programs. In Patrick Doherty, John Mylopou- los, and Christopher A. Welty, editors, KR-06, pages 308- 317. AAAI Press, 2006.","title":"Computational properties of epistemic logic programs","authors":"Yan Zhang","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}