✦ LIBER ✦

A theory of complete logic programs with equality

✍ Scribed by Joxan Jaffar; Jean-Louis Lassez; Michael J. Maher

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 993 KB
Volume: 1
Category: Article
ISSN: 0743-1066
DOI: 10.1016/0743-1066(84)90010-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on semantics of logic programs wi

A note on semantics of logic programs with equality based on complete sets of E-unifiers

✍ Anatoli Degtyarev; Andrei Voronkov 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 538 KB

We discuss semantics of equational Horn-clause programs based on the notion of a complete set of E-unifiers. We prove incompleteness of SLDE tresolution in the general case. SLDELresolution was introduced by Gallier and Raatz who proved its completeness for the case of well-behaved programs. We also

Completions of perpetual logic programs

✍ James Hein 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 876 KB

Completeness Proofs for Some Logics of P

Completeness Proofs for Some Logics of Programs

✍ Bogdan S. Chlebus 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 712 KB

On strictly arithmetical completeness in

On strictly arithmetical completeness in logics of programs

✍ Andrzej Szalas 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 892 KB

Equality, types, modules, and (why not?)

Equality, types, modules, and (why not?) generics for logic programming : Goguen, J. and Meseguer, J., journal of logic programming 1:179 (1984)

📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 38 KB

Proof method of partial correctness and

Proof method of partial correctness and weak completeness for normal logic programs

✍ Gérard Ferrand; Pierre Deransart 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 951 KB