CSP(M): Constraint satisfaction problem over models

Ákos Horváth, Dániel Varró

Research output: Conference contribution

5 Citations (Scopus)

Abstract

Constraint satisfaction programming (CSP) has been successfully used in model-driven development (MDD) for solving a wide range of (combinatorial) problems. In CSP, declarative constraints capture restrictions over variables with finite domains where both the number of variables and their domains are required to be a priori finite. However, the existing formulation of constraint satisfaction problems can be too restrictive to support dynamically evolving domains and constraints necessitated in many MDD applications as the graph nature of the underlying models needs to be encoded with variables of finite domain. In the paper, we reformulate the constraint satisfaction problem directly on the model-level by using graph patterns as constraints and graph transformation rules as labeling operations. This allows expressing problems composed of dynamic model manipulation and complex graph structural constraints in an intuitive way. Furthermore, we present a prototype constraint solver for the domain of graph models built upon the Viatra2 model transformation framework, and provide an initial evaluation of its performance.

Original languageEnglish
Title of host publicationModel Driven Engineering Languages and Systems - 12th International Conference, MODELS 2009, Proceedings
Pages107-121
Number of pages15
DOIs
Publication statusPublished - dec. 1 2009
Event12th International Conference on Model Driven Engineering Languages and Systems, MODELS 2009 - Denver, CO, United States
Duration: okt. 4 2009okt. 9 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5795 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Conference on Model Driven Engineering Languages and Systems, MODELS 2009
CountryUnited States
CityDenver, CO
Period10/4/0910/9/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'CSP(M): Constraint satisfaction problem over models'. Together they form a unique fingerprint.

  • Cite this

    Horváth, Á., & Varró, D. (2009). CSP(M): Constraint satisfaction problem over models. In Model Driven Engineering Languages and Systems - 12th International Conference, MODELS 2009, Proceedings (pp. 107-121). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5795 LNCS). https://doi.org/10.1007/978-3-642-04425-0_9