Semi-automatic generation of CHR solvers from global constraint automata

Frank Raiser. Semi-automatic generation of CHR solvers from global constraint automata. 2008, Ulmer Informatik Berichte 2008-03, Ulm University, Technical Report

Abstract:

Constraint programming often involves global constraints, which have been cataloged in [1] and for which various custom filtering algorithms have been published. This work presents a semi-automatic generation of CHR solvers for the set of global constraints which can be defined by specific automata described in [2]. The solvers only need to be generated once and achieve arc-consistency for over 40 global constraints.