Constraint processing in cc(FD) (1992)
| Citations: | 64 - 10 self |
BibTeX
@TECHREPORT{Hentenryck92constraintprocessing,
author = {Pascal Van Hentenryck and Vijay Saraswat and Yves Deville},
title = {Constraint processing in cc(FD)},
institution = {},
year = {1992}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Constraint logic programming languages such as CHIP [26,5] have demonstrated the practicality of declarative languages supporting consistency techniques and nondeterminism. Nevertheless they suffer from the black-box effect: the programmer must work with a monolithic, unmodifiable, inextensible constraint-solver. This problem can be overcome within the logically and computationally richer concurrent constraint (cc) programming paradigm [17]. We show that some basic constraint-operations currently hardwired into constraint-solvers can be abstracted and made available as combinators in the programming language. This allows complex constraint-solvers to be decomposed into logically clean and efficiently implementable cc programs over a much simpler constraint system. In particular, we show that the CHIP constraint-solver can be simply programmed in cc(FD), acc language with an extremely simple built-in constraint solver for finite domains.
