@inproceedings{9255ab470a984dca8b6a7a9ae5f1d0df,
title = "Constructive negation by pruning and optimization higher-order predicates for CLP and CC languages",
abstract = "We survey several forms of negation in constraint logic programming following the program{\textquoteright}s completion approach. We show that a new scheme called constructive negation by pruning provides a generic operational semantics which is correct and complete w.r.t. Kunen{\textquoteright}s threevalued logic semantics. We emphasis a full abstraction result which permits to go beyond the theorem proving point of view and to completely characterize the operational behavior of CLP programs with negation. We derive from these results a complete scheme for optimization higher-order predicates in CLP languages, and an operational semantics for concurrent constraint (CC) languages extended with negation and optimization higher-order agents.",
author = "Fran{\c c}ois Fages",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1995.; 22nd Spring School in Theoretical Computer Science ; Conference date: 16-05-1994 Through 20-05-1994",
year = "1995",
month = jan,
day = "1",
doi = "10.1007/3-540-59155-9\_5",
language = "English",
isbn = "3540591559",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "68--89",
editor = "Andreas Podelski",
booktitle = "Constraint Programming",
}