Semi-automatic Generation of CHR Solvers for Global Constraints

Authors:
Frank Raiser
Affiliations:
Faculty of Engineering and Computer Sciences, University of Ulm, Germany
Venue:
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Year:
2008

Citing 3
Cited 1

Operational Equivalence of CHR Programs and Constraints

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Automatic generation of CHR constraint solvers

Theory and Practice of Logic Programming
Global Constraint Catalogue: Past, Present and Future

Constraints

Analysing graph transformation systems through constraint handling rules

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint programming often involves global constraints, for which various custom filtering algorithms have been published. This work presents a semi-automatic generation of CHR solvers for the subset of global constraints defineable by specific automata. The generation is based on a constraint logic program modelling an automaton and an improved version of the Prim-Miner algorithm. The solvers only need to be generated once and achieve arc-consistency for over 40 global constraints.