{"type":"ScholarlyArticle","title":"First-Order Modular Logic Programs and their Conservative Extensions (Extended Abstract)","authors":[{"name":"Amelia Harrison","slug":"amelia-harrison","given":"Amelia","family":"Harrison","affiliation":"University of Texas at Austin"},{"name":"Yuliya Lierler","slug":"yuliya-lierler","given":"Yuliya","family":"Lierler","affiliation":"University of Nebraska Omaha"}],"abstract":"This paper introduces first-order modular logic programs, which provide a way of viewing answer set programs as consisting of many independent, meaningful modules. We also present conservative extensions of such programs. This concept helps to identify strong relationships between modular programs as well as between traditional programs. For example, we illustrate how the notion of a conservative extension can be used to justify the common projection rewriting. This is a short version of a paper was presented at the 32nd International Conference on Logic Programming (Harrison and Lierler, 2016).","doi":"10.24963/ijcai.2017/682","url":"https://ijcai.org/proceedings/2017/682","pdf":"https://ijcai.org/proceedings/2017/0682.pdf","markdown":"https://ijcai.org/proceedings/2017/682.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/682","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":"Best Sister Conferences","track":"Best Sister Conferences","number":682,"pages":{"first":4859,"last":4863},"keywords":["Artificial Intelligence: knowledge representation and reasoning"],"videos":[],"references":[{"position":1,"raw":"[Denecker et al., 2012] Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, and Joost Vennekens. A tarskian informal semantics for answer set programming. 2012.","title":"A tarskian informal semantics for answer set programming","authors":"Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Faber et al., 1999] Wolfgang Faber, Nicola Leone, Cristinel Mateis, and Gerald Pfeifer. Using database optimization techniques for nonmonotonic reasoning. pages 135-139, 1999.","title":"Using database optimization techniques for nonmonotonic reasoning","authors":"Faber","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Ferraris and Lifschitz, 2005] Paolo Ferraris and Vladimir Lifschitz. Weight constraints as nested expressions. The- ory and Practice of Logic Programming, 5(1-2):45-74, 2005.","title":"Weight constraints as nested expressions","authors":"Paolo Ferraris, Vladimir Lifschitz","year":"2005","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Ferraris et al., 2009] Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz, and Ravi Palla. Symmetric splitting in the general theory of stable models. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pages 797-803, 2009.","title":"Symmetric splitting in the general theory of stable models","authors":"Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz, Ravi Palla","year":"2009","venue":"Proceedings of International Joint Conference on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2009/137"},{"position":5,"raw":"[Ferraris et al., 2011] Paolo Ferraris, Joohyung Lee, and Vladimir Lifschitz. Stable models and circumscription. Artificial Intelligence, 175:236-263, 2011.","title":"Stable models and circumscription","authors":"Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz","year":"2011","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Ferraris, 2005] Paolo Ferraris. Answer sets for proposi- tional theories. In Proceedings of International Confer- ence on Logic Programming and Nonmonotonic Reason- ing (LPNMR), pages 119-131, 2005.","title":"Answer sets for propositional theories","authors":"Paolo Ferraris","year":"2005","venue":"Proceedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gelfond and Lifschitz, 1988] Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert Kowalski and Kenneth Bowen, editors, Proceedings of International Logic Pro- gramming Conference and Symposium, pages 1070-1080.","title":"The stable model semantics for logic programming","authors":"Michael Gelfond, Vladimir Lifschitz","year":null,"venue":"Proceedings of International Logic Programming Conference and Symposium","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Harrison and Lierler, 2016] Amelia Harrison and Yuliya Lierler. First-order modular logic programs and their con- servative extensions. Theory and Practice of Logic Pro- gramming, 16(5-6):755-770, 2016.","title":"Amelia Harrison and Yuliya Lierler. First-order modular logic programs and their conservative extensions","authors":"Lierler Harrison","year":"2016","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Leake, 2016] David Leake, editor. AI Magazine, volume 37(3). 2016. Special Issue on Answer Set Programming. [Lierler and Truszczyński, 2013]","title":"AI Magazine","authors":null,"year":"2013","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Yuliya Lierler and Miroslaw Truszczyński. Modular answer set solv- ing. In Proceedings of the 27th AAAI Conference on Artificial Intelligence, 2013.","title":"Modular answer set solving","authors":"Yuliya Lierler, Miroslaw Truszczyński","year":"2013","venue":"Proceedings of the 27th AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Lifschitz et al., 2001] Vladimir Lifschitz, David Pearce, and Agustin Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526-541, 2001.","title":"Strongly equivalent logic programs","authors":"Vladimir Lifschitz, David Pearce, Agustin Valverde","year":"2001","venue":"ACM Transactions on Computational Logic","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Lifschitz, 2002] Vladimir Lifschitz. Answer set program- ming and plan generation. Artificial Intelligence, 138:39- 54, 2002.","title":"Answer set programming and plan generation","authors":"Vladimir Lifschitz","year":"2002","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Oikarinen and Janhunen, 2008] Emilia Oikarinen and Tomi Janhunen. Achieving compositionality of the stable model semantics for Smodels programs. Theory and Practice of Logic Programming, 5-6:717-761, 2008.","title":"Achieving compositionality of the stable model semantics for Smodels programs","authors":"Janhunen Oikarinen, Emilia Oikarinen, Tomi Janhunen","year":"2008","venue":"Theory and Practice of Logic Programming","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Wang et al., 2014] Yisong Wang, Yan Zhang, Yi Zhou, and Mingyi Zhang. Knowledge forgetting in answer set pro- gramming. Journal of Artificial Intelligence Research, 50(1):31-70, 2014.","title":"Knowledge forgetting in answer set programming","authors":"Wang","year":"2014","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}