CP(Graph): Introducing a Graph Computation Domain in Constraint Programming


In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be translated to constrained subgraph finding. Our approach extends constraint programming by introducing CP(Graph), a new computation domain focused on graphs including a new type of variable: graph domain variables as well as constraints over these variables and their propagators. These constraints are subdivided into kernel constraints and additional constraints formulated as networks of kernel constraints. For some of these constraints a dedicated global constraint and its associated propagator are sketched. CP(Graph) is integrated with finite domain and finite sets computation domains, allowing the combining of constraints of these domains with graph constraints. A prototype of CP(Graph) built over finite domains and finite sets in Oz is presented. And we show that a problem of biochemical network analysis can be very simply described and solved within CP(Graph).

DOI: 10.1007/11564751_18

Extracted Key Phrases

4 Figures and Tables


Citations per Year

106 Citations

Semantic Scholar estimates that this publication has 106 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Dooms2005CPGraphIA, title={CP(Graph): Introducing a Graph Computation Domain in Constraint Programming}, author={Gr{\'e}goire Dooms and Yves Deville and Pierre Dupont}, booktitle={CP}, year={2005} }