Affiliation:
1. Brandeis Univ., Waltham, MA
Abstract
Constraint Logic Programming (CLP) is an extension of Logic Programming aimed at replacing the pattern matching mechanism of unification, as used in Prolog, by a more general operation called constraint satisfaction. This aritcle provides a panoramic view of the recent work done in designing and implementing CLP languages. It also presents a summary of their theoretical foundations, discusses implementation issues, compares the major CLP languages, and suggests directions for further work.
Publisher
Association for Computing Machinery (ACM)
Reference46 articles.
1. Apt K.R. Introduction to logic programming. Rep. TR-87-35 Dept of Computer Science Univ. of Texas at Austin July 1988. Apt K.R. Introduction to logic programming. Rep. TR-87-35 Dept of Computer Science Univ. of Texas at Austin July 1988.
2. A bibliography of quantifier elimination for real closed fields
Cited by
141 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献