The Design of COMMA: An Extensible Framework for Mapping Constrained Objects to Native Solver Models

Liew, Chun Wai; Shapiro, Joel A.; Smith, Donald E.

doi:10.1109/ictai.2007.119

Cited by 13 publications

(13 citation statements)

References 26 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More recently, the definition of high-level modeling languages is becoming a hot topic in CP [15]. Then, new modeling languages have been developed such as Zinc and MiniZinc [13], Essence [7] and s-COMMA [18]. In these three cases, the high-level modeling language is translated into existing CP solver languages by using a flat intermediary language to ease the translation process and to increase the reusability of most transformations and reformulation tasks.…”

Section: Interoperability Of Constraint Programming Languagesmentioning

confidence: 99%

Automatically Discovering Hidden Transformation Chaining Constraints

Chenouard

Jouault

2009

Model Driven Engineering Languages and Systems

View full text Add to dashboard Cite

Abstract. Model transformations operate on models conforming to precisely defined metamodels. Consequently, it often seems relatively easy to chain them: the output of a transformation may be given as input to a second one if metamodels match. However, this simple rule has some obvious limitations. For instance, a transformation may only use a subset of a metamodel. Therefore, chaining transformations appropriately requires more information. We present here an approach that automatically discovers more detailed information about actual chaining constraints by statically analyzing transformations. The objective is to provide developers who decide to chain transformations with more data on which to base their choices. This approach has been successfully applied to the case of a library of endogenous transformations. They all have the same source and target metamodel but have some hidden chaining constraints. In such a case, the simple metamodel matching rule given above does not provide any useful information.

show abstract

Section: Interoperability Of Constraint Programming Languagesmentioning

confidence: 99%

Automatically Discovering Hidden Transformation Chaining Constraints

Chenouard

Jouault

2009

Model Driven Engineering Languages and Systems

View full text Add to dashboard Cite

show abstract

“…alldifferent, cumulatives) is supported. Additional constraints can be integrated to this basic set by means of extension mechanisms (for details refer to [29]).…”

Section: Constraint Zonesmentioning

confidence: 99%

Model-driven constraint programming

Chenouard

Granvilliers

Soto

2008

Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Self Cite

View full text Add to dashboard Cite

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 s-COMMA platform that efficiently implements the chain from modeling to solving constraint problems.

show abstract

“…A direct translation from s-COMMA to executable solver code is feasible (in fact, we have studied this in (Soto & Granvilliers, 2007)). However, many statements provided by s-COMMA are not supported by solvers.…”

Section: From S-comma To Flat S-commamentioning

confidence: 99%

“…In this work, we follow this research direction by proposing a solver-independent modelling language but using an object-oriented approach. Our system is called s-COMMA (Soto & Granvilliers, 2007) and it can be regarded as a hybrid built from a combination of an objectoriented language and a constraint language. The s-COMMA constraint language provides typical data structures, control operations, and first-order logic to define constraint-based formulas.…”

Section: Introductionmentioning

confidence: 99%