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

Degtyarev, Anatoli
Voronkov, Andrei

Open link

Publication date

September 1996

DOI

10.1016/0743-1066(96)00049-0

Publisher

Published by Elsevier Inc.

Abstract

AbstractWe discuss semantics of equational Horn-clause programs based on the notion of a complete set of E-unifiers. We prove incompleteness of SLDE†-resolution in the general case. SLDE†-resolution 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

Extracted data

We use cookies to provide a better user experience.

Data Protection

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

Abstract

Extracted data

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

Abstract

Extracted data

Related items

Related items