CLP(SC): Implementation and Efficiency Considerations
| Author(s) : | Jeffrey S. Foster, |
| Publisher : | N/A |
| Publication Date : | 1996 |
| ISSN : | N/A |
| Abstract : | CLP(SC) is a constraint logic programming language over set constraints proposed by Kozen [7]. In this paper, we describe a complete C++ implementation of CLP(SC). We describe the data structures used to represent systems of set constraints and an efficient algorithm, a modification of one given in [7], for unifying constraints. In addition, we investigate two further techniques for increasing efficiency: keeping track of variable equalities and doing PROLOGstyle unification. 1, |