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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters Jg. 74; H. 3; S. 147 - 156
Hauptverfasser:	Dovier, Agostino, Pontelli, Enrico, Rossi, Gianfranco
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 31.05.2000 Elsevier Sequoia S.A
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!