Model-driven constraint programming

Raphaël Chenouard, Laurent Granvilliers, Ricardo Soto

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

22 Citas (Scopus)

Resumen

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.

Idioma originalInglés
Título de la publicación alojadaPPDP'08 - Proceedings of the 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming
Páginas236-246
Número de páginas11
DOI
EstadoPublicada - 2008
Publicado de forma externa
EventoPPDP 2008: 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming - Valencia, Espana
Duración: 15 jul 200817 jul 2008

Serie de la publicación

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

Conferencia

ConferenciaPPDP 2008: 10th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming
País/TerritorioEspana
CiudadValencia
Período15/07/0817/07/08

Huella

Profundice en los temas de investigación de 'Model-driven constraint programming'. En conjunto forman una huella única.

Citar esto