𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Oriented Equational Logic Programming is Complete

✍ Scribed by CHRISTOPHER LYNCH

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
614 KB
Volume
23
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Oriented equational clauses as a program
Oriented equational clauses as a programming language
✍ Laurent Fribourg πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 844 KB

In the #Prolog language, Horn clauses of first-order logic are regarded as programs, and the resolution procedure is used as an interpreter. In this paper, we present the formalism of Horn oriented equational clauses (Horn clauses with a rewrite rule as the head part, and a list of equations as the

Completing open logic programs by constr
Completing open logic programs by constructive induction
✍ Esra Erdem; Pierre Flener πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 247 KB

We consider part of the problem of schema-biased inductive synthesis of recursive logic Ε½ programs from incomplete specifications, such as clausal evidence for instance, but not . necessarily, ground positive and negative examples . After synthesizing the base clause Ε½ . and introducing recursive ca

Comments on β€œlogic programming with equa
Comments on β€œlogic programming with equations”
✍ Pier Giorgio Bosco; Elio Giovannetti; Corrado Moiso; Catuscia Palamidessi πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 343 KB

This note discusses the results of the compilational approach of equational logic programming developed by Van Emden and Yukawa, and compares them with similar results obtained by Bosco et al. and by Fribourg. We show that Van Emden and Yukawa's completeness result contains an inaccuracy, and we sug