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

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 74; číslo 3; s. 147 - 156
Hlavní autori:	Dovier, Agostino, Pontelli, Enrico, Rossi, Gianfranco
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 31.05.2000 Elsevier Sequoia S.A
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!