Semi-automatic generation of CHR solvers for global constraints

Frank Raiser. Semi-automatic generation of CHR solvers for global constraints. 2008, Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, volume 5202 of Lecture Notes in Computer Science, pages 588-592, Conference

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.