A Modeling Layer for Constraint-Programming Libraries

Authors:
Laurent Michel;Pascal Van Hentenryck
Affiliations:
Department of Computer Science and Engineering, University of Connecticut, Storrs, Connecticut 06269-2155, USA;Department of Computer Science, Brown University, Box 1910, Providence, Rhode Island 02912, USA
Venue:
INFORMS Journal on Computing
Year:
2005

Citing 7
Cited 0

The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
An introduction to Prolog III

Communications of the ACM
The OPL optimization programming language

The OPL optimization programming language
Search and strategies in OPL

ACM Transactions on Computational Logic (TOCL)
Probe Backtrack Search for Minimal Perturbation in DynamicScheduling

Constraints
Constraint Programming in OPL

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Localizer++: An Open Library for local Search

Localizer++: An Open Library for local Search

Quantified Score

Hi-index	0.00

Visualization

Abstract

Mathematical-modeling and constraint-programming languages have orthogonal strengths in stating combinatorial optimization problems. Modeling languages typically feature high-level set and algebraic notations, while constraint-programming languages provide a rich constraint language and the ability to specify search procedures. This paper shows that many of the functionalities typically found in modeling languages can be integrated elegantly in constraint-programming libraries without defining a specific language or preprocessor. In particular, it presents the design of MODELER, a C++ modeling layer for constraint programming which demonstrates how to enhance the expressiveness of constraint-programming libraries and to bridge much of the gap between libraries and modeling languages.