{"type":"ScholarlyArticle","title":"Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract)","authors":[{"name":"Yi-Dong Shen","slug":"yi-dong-shen","given":"Yi-Dong","family":"Shen","affiliation":"State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences , Beijing , China"},{"name":"Thomas Eiter","slug":"thomas-eiter","given":"Thomas","family":"Eiter","affiliation":"Institut für Informationssysteme , Technische Universität Wien , Favoritenstraße 9-11 , A-1040 Vienna , Austria"}],"abstract":"Epistemic negation 'not' along with default negation 'neg' plays a key role in knowledge representation and nonmonotonic reasoning. However, the existing approaches behave not satisfactorily in that they suffer from the problems of unintended world views due to recursion through the epistemic modal operator  K or M ( K F  and  M F are shorthands for (neg not F) and (not neg F), respectively). In this paper we present a general approach to epistemic negation which is free of unintended world views and thus offers a solution to the long-standing problem of epistemic specifications which were introduced by Gelfond 1991 over two decades ago.","doi":"10.24963/ijcai.2017/722","url":"https://ijcai.org/proceedings/2017/722","pdf":"https://ijcai.org/proceedings/2017/0722.pdf","markdown":"https://ijcai.org/proceedings/2017/722.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/722","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":"Journal track","track":"Journal track","number":722,"pages":{"first":5060,"last":5064},"keywords":["Knowledge Representation, Reasoning, and Logic: Non-monotonic Reasoning","Knowledge Representation, Reasoning, and Logic: Knowledge Representation Languages"],"videos":[],"references":[{"position":1,"raw":"[Bartholomew et al., 2011] M. Bartholomew, J. Lee, and Y. Meng. First-order extension of the FLP stable model semantics via modified circumscription. In Proc. 22nd Int'l Joint Conference on Artificial Intelligence (IJCAI- 11), pages 724-730, 2011.","title":"First-order extension of the FLP stable model semantics via modified circumscription","authors":"M Bartholomew, J Lee, Y Meng","year":"2011","venue":"Proc. 22nd Int'l Joint Conference on Artificial Intelligence (IJCAI-11)","doi":null,"url":null,"internal_url":"/proceedings/2011/128"},{"position":2,"raw":"[del Cerro et al., 2015] L. F. del Cerro, A. Herzig, and Ezgi Iraz Su. Epistemic equilibrium logic. In Proc. 24th International Joint Conference on Artificial Intelligence (IJCAI-15), pages 2964-2970. AAAI Press/IJCAI, 2015.","title":"Epistemic equilibrium logic","authors":"L F Del Cerro, A Herzig, Ezgi Iraz Su","year":"2015","venue":"Proc. 24th International Joint Conference on Artificial Intelligence (IJCAI-15)","doi":null,"url":null,"internal_url":"/proceedings/2015/419"},{"position":3,"raw":"[Faber et al., 2011] W. Faber, G. Pfeifer, and N. Leone. Se- mantics and complexity of recursive aggregates in answer set programming. Artificial Intelligence, 175(1):278-298, 2011.","title":"Semantics and complexity of recursive aggregates in answer set programming","authors":"W Faber, G Pfeifer, N Leone","year":"2011","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Ferraris et al., 2011] P. Ferraris, J. Lee, and V. Lifschitz. Stable models and circumscription. Artificial Intelligence, 175(1):236-263, 2011.","title":"Stable models and circumscription","authors":"P Ferraris, J Lee, V Lifschitz","year":"2011","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Gelfond and Lifschitz, 1988] M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Logic Programming, Proceedings of the Fifth Interna- tional Conference and Symposium, pages 1070-1080, 1988.","title":"The stable model semantics for logic programming","authors":"M Gelfond, V Lifschitz","year":"1988","venue":"Proceedings of the Fifth International Conference and Symposium","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Gelfond and Lifschitz, 1991] M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.","title":"Classical negation in logic programs and disjunctive databases","authors":"M Gelfond, V Lifschitz","year":"1991","venue":"New Generation Computing","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gelfond, 1991] M. Gelfond. Strong introspection. In Pro- ceedings of the 9th National Conference on Artificial In- telligence, pages 386-391, 1991.","title":"Strong introspection","authors":"M Gelfond","year":"1991","venue":"Proceedings of the 9th National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gelfond, 1994] M. Gelfond. Logic programming and rea- soning with incomplete information. Annals of Mathemat- ics and Artificial Intelligence, 12(1-2):89-116, 1994.","title":"Logic programming and reasoning with incomplete information","authors":"M Gelfond","year":"1994","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Gelfond, 2011] M. Gelfond. New semantics for epistemic specifications. In Logic Programming and Nonmonotonic Reasoning -11th International Conference LPNMR, pages 260-265, 2011.","title":"New semantics for epistemic specifications","authors":"M Gelfond","year":"2011","venue":"Logic Programming and Nonmonotonic Reasoning -11th International Conference LPNMR","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Kahl et al., 2015] P. Kahl, R. Watson, E. Balai, M. Gelfond, and Y. 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":"P Kahl, R Watson, E Balai, M Gelfond, Y Zhang","year":"2015","venue":"Journal of Logic and Computation","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Kahl, 2014] P. Kahl. Refining the semantics for epistemic logic programs. PhD thesis, Texas Tech University, USA, 2014.","title":"Refining the semantics for epistemic logic programs","authors":"P Kahl","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Lifschitz et al., 1999] V. Lifschitz, L. R. Tang, and H. Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25(1-2):369- 389, 1999.","title":"Nested expressions in logic programs","authors":"V Lifschitz, L R Tang, H Turner","year":"1999","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Pearce, 2006] D. Pearce. Equilibrium logic. Annals of Mathematics and Artificial Intelligence, 47(1-2):3-41, 2006.","title":"Equilibrium logic","authors":"D Pearce","year":"2006","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Pelov et al., 2007] W. Pelov, M. Denecker, and M. Bruynooghe. Well-founded and stable semantics of logic programs with aggregates. Theory and Practice of Logic Programming, 7(3):301-353, 2007.","title":"Well-founded and stable semantics of logic programs with aggregates","authors":"W Pelov, M Denecker, M Bruynooghe","year":"2007","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Reiter, 1978] R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, eds., Logic and Data Bases, pages 119-140. Plenum, New York, 1978.","title":"On closed world data bases","authors":"R Reiter","year":"1978","venue":"Logic and Data Bases","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Shen et al., 2014] Y. D. Shen, K. Wang, T. Eiter, M. Fink, C. Redl, T. Krennwallner, and J. Deng. FLP answer set semantics without circular justifications for general logic programs. Artificial Intelligence, 213:1-41, 2014.","title":"FLP answer set semantics without circular justifications for general logic programs","authors":"Y D Shen, K Wang, T Eiter, M Fink, C Redl, T Krennwallner, J Deng","year":"2014","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Truszczynski, 2010] M. Truszczynski. Reducts of proposi- tional theories, satisfiability relations, and generalizations of semantics of logic programs. Artificial Intelligence, 174(16-17):1285-1306, 2010.","title":"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs","authors":"M Truszczynski","year":"2010","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Truszczynski, 2011] M. Truszczynski. Revisiting epistemic specifications. In Logic Programming, Knowledge Rep- resentation, and Nonmonotonic Reasoning -Essays Ded- icated to Michael Gelfond on the Occasion of His 65th Birthday, pages 315-333, 2011.","title":"Revisiting epistemic specifications","authors":"M 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."}