𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Anatoli Degtyarev; Andrei Voronkov


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
538 KB
Volume
28
Category
Article
ISSN
0743-1066

No coin nor oath required. For personal study only.

✦ Synopsis


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 define and compare several fixpoint semantics based on complete sets of E-unifiers.