A Causal Logic of Logic Programming

The causal logic from (Bochman 2003b) is shown to provide a natural logical basis for logic programming. More exactly, it is argued that any logic program can be seen as a causal theory satisfying the Negation As Default principle (alias Closed World Assumption). Moreover, unlike well-known translations of logic programs to other nonmonotonic formalisms, the established correspondence between logic programs and causal theories is bidirectional in the sense that, for an appropriate causal logic, any causal theory is reducible to a logic program. The correspondence is shown to hold for logic programs of a most general kind involving disjunctions and default negations in heads of the rules. It is shown also to be adequate for a broad range of logic programming semantics, including stable, supported and partial stable models. The results strongly suggest that the causal logic can serve as a (long missing) logic of logic programming.

[1]  Vladimir Lifschitz,et al.  Pointwise circumscription , 1987 .

[2]  Hudson Turner,et al.  Strong Equivalence for Logic Programs and Default Theories (Made Easy) , 2001, LPNMR.

[3]  J. M. Dunn,et al.  Modern Uses of Multiple-Valued Logic , 1977 .

[4]  autoepistemic Zogic Logic programming and negation : a survey , 2001 .

[5]  Alexander Bochman,et al.  A Logical Foundation for Logic Programming I: Biconsequence Relations and Nonmonotonic Completion , 1998, J. Log. Program..

[6]  Alexander Bochman,et al.  Biconsequence Relations: A Four-Valued Formalism of Reasoning with Inconsistency and Incompleteness , 1998, Notre Dame J. Formal Log..

[7]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

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

[9]  Jack Minker,et al.  Logic and Data Bases , 1978, Springer US.

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

[11]  Alexander Bochman A Logical Foundation for Logic Programming II: Semantics of General Logic Programs , 1998, J. Log. Program..

[12]  R. Reiter On Closed World Data Bases , 1987, Logic and Data Bases.

[13]  Chiaki Sakama,et al.  Negation as Failure in the Head , 1998, J. Log. Program..

[14]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[15]  Ronald Fagin,et al.  A Nonstandard Approach to the Logical Omniscience Problem , 1990, Artif. Intell..

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

[17]  Enrico Giunchiglia,et al.  Nonmonotonic causal theories , 2004, Artif. Intell..

[18]  Hudson Turner,et al.  Causal Theories of Action and Change , 1997, AAAI/IAAI.

[19]  David Pearce,et al.  Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..

[20]  J. W. LLOYD,et al.  Making Prolog more Expressive , 1984, J. Log. Program..

[21]  Jürgen Dix,et al.  Causal Models of Disjunctive Logic Programs , 1994, ICLP.

[22]  John S. Schlipf A comparison of notions of negation as failure , 1995 .

[23]  Nuel D. Belnap,et al.  A Useful Four-Valued Logic , 1977 .

[24]  John C. Shepherdson,et al.  Negation in Logic Programming , 1988, Foundations of Deductive Databases and Logic Programming..

[25]  Michael Gelfond,et al.  Logic programming and reasoning with incomplete information , 1994, Annals of Mathematics and Artificial Intelligence.

[26]  Vladimir Lifschitz,et al.  Nested expressions in logic programs , 1999, Annals of Mathematics and Artificial Intelligence.

[27]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[28]  Alexander Bochman,et al.  Collective Argumentation and Disjunctive Logic Programming , 2003, J. Log. Comput..

[29]  Richard Routley,et al.  Relevant logics and their rivals , 1982 .

[30]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[31]  Alexander Bochman Production Inference, Nonmonotonicity and Abduction , 2004, ISAIM.

[32]  Mark Wallace,et al.  Tight, Consistent and Computable Completions for Unrestricted Logic Programs , 1993, The Journal of Logic Programming.

[33]  Melvin Fitting,et al.  Bilattices and the Semantics of Logic Programming , 1991, J. Log. Program..

[34]  Giorgio Levi Advances in logic programming theory , 1995 .