A NOTE ON SEMANTICS OF LOGIC PROGRAMS WITH EQUALITY BASED ON COMPLETE-SETS OF E-UNIFIERS

Authors
DEGTYAREV A VORONKOV A
Citation
A. Degtyarev et A. Voronkov, A NOTE ON SEMANTICS OF LOGIC PROGRAMS WITH EQUALITY BASED ON COMPLETE-SETS OF E-UNIFIERS, The journal of logic programming, 28(3), 1996, pp. 207-216
Citations number
20
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Theory & Methods
Journal title
The journal of logic programming → ACNP
ISSN journal
07431066
Volume
28
Issue
3
Year of publication
1996
Pages
207 - 216
Database
ISI
SICI code
0743-1066(1996)28:3<207:ANOSOL>2.0.ZU;2-J
Abstract
We discuss semantics of equational Horn-clause programs based on the n otion of a complete set of E-unifiers. We prove incompleteness of SLDE dagger-resolution in the general case. SLDE dagger-resolution was int roduced 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.