Model-driven constraint programming

Raphaël Chenouard, Laurent Granvilliers, Ricardo Soto

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

22 Scopus citations

Abstract

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 model-driven 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 high-level modeling language, and the quality of metamodeling techniques to implement the transformations. A main result is the s-COMMA platform that efficiently implements the chain from modeling to solving constraint problems.

Original languageEnglish
Title of host publicationPPDP'08 - Proceedings of the 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming
Pages236-246
Number of pages11
DOIs
StatePublished - 2008
Externally publishedYes
EventPPDP 2008: 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming - Valencia, Spain
Duration: 15 Jul 200817 Jul 2008

Publication series

NamePPDP'08 - Proceedings of the 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming

Conference

ConferencePPDP 2008: 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming
Country/TerritorySpain
CityValencia
Period15/07/0817/07/08

Keywords

  • Constraint modeling languages
  • Constraint programming
  • Metamodeling
  • Model transformation

Fingerprint

Dive into the research topics of 'Model-driven constraint programming'. Together they form a unique fingerprint.

Cite this