First-Order Encodings for Modular Nonmonotonic Datalog Programs

Recently Modular Nonmonotonic Logic Programs (MLP) have been introduced which incorporate a call-by-value mechanism and allow for unrestricted calls between modules, including mutual and self recursion, as an approach to provide module constructs akin to those in conventional programming in Nonmonotonic Logic Programming under Answer Set Semantics. This paper considers MLPs in a Datalog setting and provides characterizations of their answers sets in terms of classical (Herbrand) models of a first-order formula, extending a line of research for ordinary logic programs. To this end, we lift the well-known loop formulas method to MLPs, and we also consider the recent ordered completion approach that avoids explicit construction of loop formulas using auxiliary predicates. Independent of computational perspectives, the novel characterizations widen our understanding of MLPs and they may prove useful for semantic investigations.

[1]  Thomas Eiter,et al.  Modular Nonmonotonic Logic Programming Revisited , 2009, ICLP.

[2]  Yi Zhou,et al.  Ordered completion for first-order logic programs on finite structures , 2010, Artif. Intell..

[3]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[4]  Haim Gaifman,et al.  Fully abstract compositional semantics for logic programs , 1989, POPL '89.

[5]  Wolfgang Faber,et al.  Semantics and complexity of recursive aggregates in answer set programming , 2011, Artif. Intell..

[6]  Jack Minker.  Foundations of deductive databases and logic programming , 1988 .

[7]  Miroslaw Truszczynski.  Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs , 2010, Artif. Intell..

[8]  Wolfgang Faber,et al.  Logic Programming and Nonmonotonic Reasoning , 2011, Lecture Notes in Computer Science.

[9]  Vladimir Lifschitz,et al.  Splitting a Logic Program , 1994, ICLP.

[10]  Joohyung Lee,et al.  A generalization of the Lin-Zhao theorem , 2006, Annals of Mathematics and Artificial Intelligence.

[11]  Wolfgang Faber,et al.  Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates , 2005, LPNMR.

[12]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[13]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[14]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[15]  Thomas Eiter,et al.  On the partial semantics for disjunctive deductive databases , 2004, Annals of Mathematics and Artificial Intelligence.

[16]  Fangzhen Lin,et al.  ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..

[17]  Fangzhen Lin,et al.  Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs , 2009, ICLP.

[18]  Joohyung Lee,et al.  Loop Formulas for Disjunctive Logic Programs , 2003, ICLP.

[19]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[20]  Kenneth A. Ross,et al.  Modular stratification and magic sets for Datalog programs with negation , 1994, JACM.

[21]  Georg Gottlob,et al.  Modular Logic Programming and Generalized Quantifiers , 1997, LPNMR.

[22]  Joohyung Lee,et al.  On Reductive Semantics of Aggregates in Answer Set Programming , 2009, LPNMR.

[23]  Stefan Woltran,et al.  Modularity Aspects of Disjunctive Stable Models , 2007, LPNMR.

[24]  Carlo Zaniolo,et al.  The deductive database system [Lscr ][Dscr ][Lscr ]++ , 2002, Theory and Practice of Logic Programming.