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

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 74; číslo 3; s. 147 - 156
Hlavní autoři: Dovier, Agostino, Pontelli, Enrico, Rossi, Gianfranco
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 31.05.2000
Elsevier Sequoia S.A
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 decidability of the underlying constraint structure. We prove that the admissible closure condition is also necessary to guarantee the existence of an effective implementation of Constructive Negation.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(00)00046-6