A necessary condition for Constructive Negation in Constraint Logic Programming

Stuckey (1995) has presented a sound and complete procedure for Constructive Negation in Constraint Logic Programming, together with a sufficient condition, called admissible closure, which guarantees an effective implementation. In this paper we analyze this condition and relate it to the decidabil...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 74; no. 3; pp. 147 - 156
Main Authors:	Dovier, Agostino, Pontelli, Enrico, Rossi, Gianfranco
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 31.05.2000 Elsevier Sequoia S.A
Subjects:	Automatic theorem proving Computer programming Constraint Logic Programming Formal semantics Logic Logic programming Negation Programming languages Studies Negation Automatic theorem proving Programming languages Formal semantics Constraint Logic Programming
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!