×

Compilative constructive negation in constraint logic programs. (English) Zbl 0938.68571

Tison, Sophie (ed.), Trees in algebra and programming - CAAP ’94. 19th international colloquium, Edinburgh, GB, April 11-13, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 787, 52-67 (1994).
Summary: In this paper we define a new compilative version of constructive negation (intensional negation) in CLP and we prove its (non-ground) correctness and completeness wrt the 3-valued completion. We show that intensional negation is essentially equivalent to constructive negation and that it is indeed more efficient, as one would expect from the fact that it is a compilative technique, with the transformation and the associated normalization process being performed once and for all on the source program. We define several formal non-ground semantics, based either on the derivation rule or on the least fixpoint of an immediate consequence operator. All these semantics are proved to correctly model the observable behavior, from the viewpoint of answer constraints. We give some equivalence theorems and we show that all our denotations are the non-ground representation of a single partial interpretation, which is \(\Phi_P \uparrow \omega\), where \(\Phi_P\) is Fitting’s operator.
For the entire collection see [Zbl 0924.00045].

MSC:

68N17 Logic programming
PDFBibTeX XMLCite