Model-Driven Constraint Programming

Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calculate the solutions. This paper focuses on efficient model management (definition and transformation). From this point of view, we propose to revisit the design of constraint-programming systems. A modeldriven architecture is introduced to map solving-independent constraint models to solving-dependent decision models. Several important questions are examined, such as the need for a visual highlevel modeling language, and the quality of metamodeling techniques to implement the transformations. A main result is the sCOMMA platform that efficiently implements the chain from modeling to solving constraint problems. Categories and Subject Descriptors D.3.2 [Programming Languages]: Language Classifications--Constraint and logic languages; D.2.2 [Software Engineering]: Design Tools and Techniques--User interfaces; D.3....

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Raphaël Chenouard, Laurent Granvilliers, Ricardo Soto
• Keywords: Constraint Programming, CORR 2010, Education, Several Important Questions, Solving-independent Constraint Models