Modeling Systems for Constraint Logic Programming

TE30.1 The OPL Optimization Programming Language

• Pascal Van Hentenryck; Universite Catholique de Louvain, Dept. of Comp. Science & Eng., 2 Place Sainte-Barbe, Louvain la Neuve, B-1348 , Belgium; pvh@info.ucl.ac.be

OPL is a modeling language that attempts to enhance traditional modeling languages from mathematical programming with constraint programming notations and algorithms and the ability to define search procedures at a high level. The novel modeling tools include higher-order constraints, logical combinations of constraints, arrays indexed by expressions containing variables, global constraints...

TE30.2 Designing an Open Interface for Hooking Constraint Logic Programming Solvers to an Algebraic Modeling Language

• Robert Fourer; Northwestern University, Dept. of IE/MS, 2225 North Campus Dr., Evanston, IL 60208-3119; 4er@iems.nwu.edu
• David M. Gay; Bell Labs, Lucent Technologies, 600 Mountain Ave., Rm. 2C-463, Murray Hill, NJ 07974-0636; dmg@bell-labs.com

Combinatorial modeling language extensions motivated by constraint logic programming methods are valuable to modelers, but introduce new difficulties in maintaining an open interface that can accommodate a variety of current and future solvers. We describe several representation and recognition issues that arise in extending the interface of the AMPL language.

TE30.3 Modeling Support for Constraint Logic Programming

• John W. Chinneck; Carleton University, Systems & Computer Eng., 1125 Colonel By Dr., Ottawa, Ontario, K1S 5B6 , Canada; chinneck@sce.carleton.ca

Tools to assist in the formulation of correct models exist for the traditional forms of mathematical programming, e.g., infeasibility analyzers, convexity analyzers, etc., but CLP poses new challenges. We explore the kinds of support needed for CLP modelers and presents prototype computer tools.