Technical Reports

A complete and terminating execution model for constraint handling rules

Hariolf Betz, Frank Raiser, and Thom Frühwirth. A complete and terminating execution model for constraint handling rules. 2010, Ulmer Informatik Berichte 2010-01, Ulm University
Abstract:We observe that the various formulations of the operational semantics of Constraint Handling Rules proposed over the years fall into a spectrum ranging from the analytical to the pragmatic. While existing analytical formulations facilitate program analysis and formal proofs of program properties, they cannot be implemented as is. We propose a novel operational semantics, which has a strong analytical foundation, while featuring a terminating execution model. We prove its soundness and completeness with respect to existing analytical formulations and we compare its expressivity to that of various other formulations.

Proceedings of the 6th Workshop on Constraint Handling Rules (CHR 2008)

Frank Raiser and Jon Sneyers. Proceedings of the 6th Workshop on Constraint Handling Rules (CHR 2008). 2009, number 555. Katholieke Universiteit Leuven, Belgium

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

Proceedings of the 5th Workshop on Constraint Handling Rules (CHR 2008)

Tom Schrijvers, Frank Raiser, and Thom Frühwirth. Proceedings of the 5th Workshop on Constraint Handling Rules (CHR 2008). 2008, number 08-10 in RISC-Linz Report Series. Research Institute for Symbolic Computation, Johannes Kepler University, Linz