Knuth-Bendix Completion of Horn Clause Programs for Restricted Linear Resolution and Paramodulation

The aim of Knuth-Bendix completion is to transform an input specification into another, equivalent specification such that a given set of inference rules becomes complete for the transformed specification. In the classical case, the specifications consist of unconditional equations, and the inference rule is term rewriting.

[1]  Peter Padawitz,et al.  Computing in Horn Clause Theories , 1988, EATCS Monographs on Theoretical Computer Science.

[2]  Harald Ganzinger,et al.  A Completion Procedure for Conditional Equations , 1988, J. Symb. Comput..

[3]  Leo Bachmair.  Proof methods for equational theories , 1987 .

[4]  Nachum Dershowitz,et al.  Orderings for Equational Proofs , 1986, LICS.

[5]  Steffen Hölldobler,et al.  Foundations of Equational Logic Programming , 1989, Lecture Notes in Computer Science.

[6]  Zohar Manna,et al.  Proving termination with multiset orderings , 1979, CACM.

[7]  Stéphane Kaplan.  Fair Conditional Term Rewriting Systems: Unification, Termination, and Confluence , 1984, ADT.

[8]  Michaël Rusinowitch,et al.  On Word Problems in Horn Theories , 1987, CTRS.

[9]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[10]  Harald Ganzinger.  A Completion Procedure for Conditional Equations , 1987, CTRS.

[11]  Jean-Pierre Jouannaud,et al.  Reductive conditional term rewriting systems , 1987, Formal Description of Programming Concepts.

[12]  Harald Ganzinger,et al.  Completion-Time Optimization of Rewrite-Time Goal Solving , 1989, RTA.

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