{"type":"ScholarlyArticle","title":"Determining Inference Semantics for Disjunctive Logic Programs (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 of Logic and Computation , Technische Universität Wien , Favoritenstraße 9-11 , A-1040 Vienna , Austria"}],"abstract":"[Gelfond and Lifschitz, 1991] introduced simple disjunctive logic programs and defined the answer set semantics called GL-semantics. We observed that the requirement of GL-semantics, i.e., an answer set should be a minimal model of the GL-reduct may be too strong and exclude some answer sets that would be reasonably acceptable. To address this, we present a novel and more permissive semantics, called determining inference semantics.","doi":"10.24963/ijcai.2020/703","url":"https://ijcai.org/proceedings/2020/703","pdf":"https://ijcai.org/proceedings/2020/0703.pdf","markdown":"https://ijcai.org/proceedings/2020/703.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/703","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Journal track","track":"Journal track","number":703,"pages":{"first":5040,"last":5044},"keywords":["Knowledge Representation and Reasoning: Knowledge Representation Languages","Knowledge Representation and Reasoning: Logics for Knowledge Representation","Knowledge Representation and Reasoning: Non-monotonic Reasoning, Common-Sense Reasoning"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24652/file_24652.m3u8","length_sec":265,"provider":"hls"}],"references":[{"position":1,"raw":"[Aguado et al., 2019] Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Pérez, and Con- cepción Vidal. Forgetting auxiliary atoms in forks. Artif. Intell., 275:575-601, 2019.","title":"Forgetting auxiliary atoms in forks","authors":"Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Pérez, Concepción Vidal","year":"2019","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":2,"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":3,"raw":"[Buss et al., 1993] Samuel Buss, Jan Krajìček, and Gaisi Takeuti. On provably total functions in bounded arith- metic theories. In Peter Clote and Jan Krajìček, editors, Arithmetic, Proof Theory and Computational Complexity, pages 116-61. Oxford University Press, 1993.","title":"On provably total functions in bounded arithmetic theories","authors":"Buss","year":"1993","venue":"Arithmetic, Proof Theory and Computational Complexity","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Calimeri et al., 2012] Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Francesco Ricca, and Torsten Schaub. ASP-Core-2: Input language for- mat, 2012. https://www.mat.unical.it/aspcomp2013/files/ ASP-CORE-2.01c.pdf.","title":"ASP-Core-2: Input language format","authors":"Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Francesco Ricca, Torsten Schaub","year":"2012","venue":null,"doi":null,"url":"https://www.mat.unical.it/aspcomp2013/files/ASP-CORE-2.01c.pdf","internal_url":null},{"position":5,"raw":"[Eiter and Gottlob, 1995] T. Eiter and G. Gottlob. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence, 15(3-4):289-323, 1995.","title":"On the computational cost of disjunctive logic programming: Propositional case","authors":"T Eiter, G Gottlob","year":"1995","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"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":7,"raw":"[Fages, 1994] Franc ¸ois Fages. Consistency of clark's com- pletion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994.","title":"Franc ¸ois Fages. Consistency of clark's completion and existence of stable models","authors":"Fages","year":"1994","venue":"Journal of Methods of Logic in Computer Science","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Ferraris and Lifschitz, 2005] Paolo Ferraris and Vladimir Lifschitz. Mathematical foundations of answer set pro- gramming. In Sergei N. Artëmov, Howard Barringer, Ar- tur S. d'Avila Garcez, Luís C. Lamb, and John Woods, ed- itors, We Will Show Them! Essays in Honour of Dov Gab- bay, Volume One, pages 615-664. College Publications, 2005.","title":"Mathematical foundations of answer set programming","authors":"Paolo Ferraris, Vladimir Lifschitz","year":"2005","venue":"We Will Show Them! Essays in Honour of Dov Gabbay","doi":null,"url":null,"internal_url":null},{"position":9,"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":10,"raw":"[Gelfond and Lifschitz, 1988] Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Logic Programming, Proceedings of the Fifth International Conference and Symposium, pages 1070-1080, 1988.","title":"The stable model semantics for logic programming","authors":"Michael Gelfond, Vladimir Lifschitz","year":"1988","venue":"Proceedings of the Fifth International Conference and Symposium","doi":null,"url":null,"internal_url":null},{"position":11,"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":12,"raw":"[Hitzler and Seda, 1999] Pascal Hitzler and Anthony Karel Seda. Multivalued mappings, fixed-point theorems and disjunctive databases. In Proceedings of the 3rd Irish Con- ference on Formal Methods, Galway, Eire, pages 113-131. British Computer Society, 1999.","title":"Multivalued mappings, fixed-point theorems and disjunctive databases","authors":"Seda Hitzler, Pascal Hitzler, Anthony Karel, Seda","year":"1999","venue":"Proceedings of the 3rd Irish Conference on Formal Methods","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Janota and Marques-Silva, 2016] Mikolás Janota and Joao Marques-Silva. On the query complexity of selecting min- imal sets for monotone predicates. Artif. Intell., 233:73- 83, 2016.","title":"Mikolás Janota and Joao Marques-Silva. On the query complexity of selecting minimal sets for monotone predicates","authors":"Marques-Silva Janota","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":14,"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":15,"raw":"[Shen and Eiter, 2019] Y. D. Shen and T. Eiter. Determining inference semantics for disjunctive logic programs. Artifi- cial Intelligence, 277:1-28, 2019.","title":"Determining inference semantics for disjunctive logic programs","authors":"Y D Shen, T Eiter","year":"2019","venue":"Artificial Intelligence","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":"[Simons et al., 2002] P. Simons, I. Niemela, and T. Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1-2):181-234, 2002.","title":"Extending and implementing the stable model semantics","authors":"P Simons, I Niemela, T Soininen","year":"2002","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":18,"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":19,"raw":"[van Emden and Kowalski, 1976] M. H. van Emden and R. A. Kowalski. The semantics of predicate logic as a pro- gramming language. Journal of the ACM, 23(4):733-742, 1976.","title":"The semantics of predicate logic as a programming language","authors":"M H Van Emden, R A Kowalski","year":"1976","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Vennekens et al., 2004] Joost Vennekens, Sofie Verbaeten, and Maurice Bruynooghe. Logic programs with annotated disjunctions. In Bart Demoen and Vladimir Lifschitz, ed- itors, Logic Programming, 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings, volume 3132 of Lecture Notes in Computer Science, pages 431-445. Springer, 2004.","title":"Logic programs with annotated disjunctions","authors":"Vennekens","year":"2004","venue":"Logic Programming, 20th International Conference, ICLP 2004","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}