A Logic Programming View of CLP (1993)
| Venue: | International Conference on Logic Programming |
| Citations: | 44 - 9 self |
BibTeX
@INPROCEEDINGS{Maher93alogic,
author = {Michael J. Maher},
title = {A Logic Programming View of CLP},
booktitle = {International Conference on Logic Programming},
year = {1993},
pages = {737--753},
publisher = {MIT Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We address the problem of lifting definitions, results, and even proofs for the theory of logic programming, so that they apply to constraint logic programming (CLP). We attempt to systematize this lifting, where it is possible, and delineate where it is not possible. We show that the Independence of Negated Constraints property of constraint domains is fundamental to several different aspects of constraint logic programming. This is a principal cause for the inability to lift some traditional logic programming results to constraint logic programming. 1 Introduction We address the problem of lifting definitions, results, and even proofs for the theory of logic programming, so that they apply to constraint logic programming (CLP). (In viewing the theory of constraint logic programming as lifted from the theory of logic programming, we are taking a logic programming view of CLP.) Several papers have dealt with this problem for specific results, mostly inspired by the CLP Scheme [10, 11...
