Oriented Equational Logic Programming is Complete

We show the completeness of an extension of SLD-resolution to the equational setting. This proves a conjecture of Laurent Fribourg and shows the completeness of an implementation of his. It is the first completeness result for superposition of equational Horn clauses which reduces to SLD resolution in the non-equational case. The inference system proved complete is actually more general than the one of Fribourg, because it allows for a selection rule on program clauses. Our completeness result also has implications for Conditional Narrowing and Basic Conditional Narrowing.

[1]  Michaël Rusinowitch,et al.  On Word Problems in Horn Theories , 1988, J. Symb. Comput..

[2]  Harald Ganzinger,et al.  On Restrictions of Ordered Paramodulation with Simplification , 1990, CADE.

[3]  L. Wos,et al.  Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .

[4]  Christopher Lynch,et al.  Paramodulation without duplication , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[5]  Albert Rubio,et al.  Basic Superposition is Complete , 1992, ESOP.

[6]  Daniel Brand,et al.  Proving Theorems with the Modification Method , 1975, SIAM J. Comput..

[7]  C. Kirchner,et al.  Deduction with symbolic constraints , 1990 .

[8]  L. Bachmair.  Canonical Equational Proofs , 1991, Progress in Theoretical Computer Science.

[9]  Wayne Snyder,et al.  Basic Paramodulation and Superposition , 1992, CADE.

[10]  Wayne Snyder,et al.  Basic Paramodulation , 1995, Inf. Comput..

[11]  Laurent Fribourg,et al.  Oriented Equational Clauses as a Programming Language , 1984, J. Log. Program..

[12]  Michaël Rusinowitch.  Theorem-Proving with Resolution and Superposition: An Extension of the Knuth and Bendic Procedure to a Complete Set of Inference Rules , 1988, FGCS.

[13]  Robert Nieuwenhuis,et al.  Efficient Deduction in Equality Horn Logic by Horn-Completion , 1991, Inf. Process. Lett..

[14]  Jean-Marie Hullot,et al.  Canonical Forms and Unification , 1980, CADE.

[15]  Michaël Rusinowitch,et al.  Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method , 1991, JACM.

[16]  Wayne Snyder,et al.  An Inference System for Horn Clause Logic with Equality: A Foundation for Conditional E-Unification and for Logic Programming in the Presence of Equality , 1990, CTRS.

[17]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[18]  Nachum Dershowitz,et al.  A Maximal-Literal Unit Strategy for Horn Clauses , 1990, CTRS.

[19]  Wayne Snyder,et al.  Goal Directed Strategies for Paramodulation , 1991, RTA.

[20]  Albert Rubio,et al.  Theorem Proving with Ordering and Equality Constrained Clauses , 1995, J. Symb. Comput..

[21]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[22]  Stéphane Kaplan,et al.  Conditional Rewrite Rules , 1984, Theor. Comput. Sci..

[23]  Maurice Nivat,et al.  Resolution of Equations in Algebraic Structures , 1989 .

[24]  Corrado Moiso,et al.  A Completeness Result for E-unification Algorithms Based on Conditional Narrowing , 1986, Foundations of Logic and Functional Programming.

[25]  Nachum Dershowitz,et al.  Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243. , 1989 .

[26]  Gerald E. Peterson,et al.  Using Forcing to Prove Completeness of Resolution and Paramodulation , 1991, J. Symb. Comput..

[27]  Robert Nieuwenhuis,et al.  On Narrowing, Refutation Proofs and Constraints , 1995, RTA.