CSP(M)

Constraint satisfaction problem over models

Ákos Horváth, D. Varró

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 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 publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages107-121
Number of pages15
Volume5795 LNCS
DOIs
Publication statusPublished - 2009
Event12th International Conference on Model Driven Engineering Languages and Systems, MODELS 2009 - Denver, CO, United States
Duration: Oct 4 2009Oct 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)03029743
ISSN (Electronic)16113349

Other

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

Fingerprint

Constraint satisfaction problems
Constraint Satisfaction
Constraint Satisfaction Problem
Programming
Graph in graph theory
Model
Graph Transformation
Constraint Programming
Model Transformation
Graph Model
Combinatorial Problems
Labeling
Manipulation
Intuitive
Dynamic Model
Prototype
Dynamic models
Restriction
Formulation
Evaluation

Keywords

  • Constraint satisfaction programming
  • Graph transformation

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Horváth, Á., & Varró, D. (2009). CSP(M): Constraint satisfaction problem over models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5795 LNCS, 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

CSP(M) : Constraint satisfaction problem over models. / Horváth, Ákos; Varró, D.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5795 LNCS 2009. p. 107-121 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5795 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Horváth, Á & Varró, D 2009, CSP(M): Constraint satisfaction problem over models. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5795 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5795 LNCS, pp. 107-121, 12th International Conference on Model Driven Engineering Languages and Systems, MODELS 2009, Denver, CO, United States, 10/4/09. https://doi.org/10.1007/978-3-642-04425-0_9
Horváth Á, Varró D. CSP(M): Constraint satisfaction problem over models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5795 LNCS. 2009. p. 107-121. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-04425-0_9
Horváth, Ákos ; Varró, D. / CSP(M) : Constraint satisfaction problem over models. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5795 LNCS 2009. pp. 107-121 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2e93b211faa840d58274fa3a5560780f,
title = "CSP(M): Constraint satisfaction problem over models",
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.",
keywords = "Constraint satisfaction programming, Graph transformation",
author = "{\'A}kos Horv{\'a}th and D. Varr{\'o}",
year = "2009",
doi = "10.1007/978-3-642-04425-0_9",
language = "English",
isbn = "3642044247",
volume = "5795 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "107--121",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - CSP(M)

T2 - Constraint satisfaction problem over models

AU - Horváth, Ákos

AU - Varró, D.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Constraint satisfaction programming

KW - Graph transformation

UR - http://www.scopus.com/inward/record.url?scp=77249142489&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77249142489&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-04425-0_9

DO - 10.1007/978-3-642-04425-0_9

M3 - Conference contribution

SN - 3642044247

SN - 9783642044243

VL - 5795 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 107

EP - 121

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -