Institute of Software Engineering and Programming Languages

CHR Research Group

Constraint Handling Rules (CHR) is a concurrent committed-choice constraint logic programming language consisting of guarded rules that transform multi-sets of atomic formulas (constraints) until exhaustion. It was designed by Thom Fruehwirth in 1991. CHR can embed many rule-based formalisms and systems, and it can describe algorithms in a compact declarative way without compromising efficiency. The clean semantics of CHR ensures that several desirable properties hold for CHR programs and also facilitates sophisticated program analysis. CHR libraries exist for Prolog, Haskell, Java, Javascript, Python and C. CHR is also available online for experimentation with many example programs. More than 250 academic and industrial projects worldwide use CHR, and about 2500 research papers reference it.

Klick here for more information on our research.

2012

47.
Sneyers, Jon; Frühwirth, Thom
Proceedings of the 9th International Workshop on Constraint Handling Rules (CHR 2012)
Band Report CW 624
Leuven, Belgium
Department of Computer Science, Katholieke Universiteit Leuven
September 2012
46.
Triossi, Andrea; Orlando, Salvatore; Raffaetà, Alessandra; Frühwirth, Thom
Compiling CHR to Parallel Hardware
Proceedings of the 14th Symposium on Principles and Practice of Declarative ProgrammingausPPDP '12, Seite 173--184
Herausgeber: ACM, New York, NY, USA
2012
DOI:10.1145/2370776.2370798
ISBN:978-1-4503-1522-7

2011

45.
Langbein, Johannes; Stelzer, Roland; Frühwirth, Thom
A Rule-Based Approach to Long-Term Routing for Autonomous Sailboats
In Schlaefer, A. and Blaurock, O., Editor, Robotic Sailing: Proceedings of the 4th International Robotic Sailing Conference, Seite 195-204
In Schlaefer, A. and Blaurock, O., Editor
Herausgeber: Springer-Verlag
2011
DOI:10.1007/978-3-642-22836-0_14
44.
Raiser, Frank; Frühwirth, Thom
Analysing graph transformation systems through constraint handling rules
Theory and Practice of Logic Programming, 11 (1) :65-109
Januar 2011
DOI:10.1017/S1471068410000438

2010

43.
Betz, Hariolf; Raiser, Frank; Frühwirth, Thom
A Complete and Terminating Execution Model for Constraint Handling Rules
Theory and Practice of Logic Programming, 10 (4-6) :597-610
Juli 2010
DOI:10.1017/S147106841000030X
42.
Langbein, Johannes; Raiser, Frank; Frühwirth, Thom
A State Equivalence and Confluence Checker for CHR
In Van Weert, P. and De Koninck, L., Editor, Proceedings of the 7th International Workshop on Constraint Handling RulesausReport, Seite 1-7
In Van Weert, P. and De Koninck, L., Editor
Herausgeber: Departement of Computer Science, Katholieke Universiteit Leuven
Mai 2010
41.
Geiselhart, Florian; Raiser, Frank; Sneyers, Jon; Frühwirth, Thom
MTSeq: Multi-touch-enabled CHR-based Music Generation and Manipulation
In Van Weert, P. and De Koninck, L., Editor, Proceedings of the 7th International Workshop on Constraint Handling RulesausReport, Seite 41-46
In Van Weert, P. and De Koninck, L., Editor
Herausgeber: Departement of Computer Science, Katholieke Universiteit Leuven
Mai 2010
40.
Betz, Hariolf; Raiser, Frank; Frühwirth, Thom
Persistent Constraints in Constraint Handling Rules
In Geske, U. and Wolf, A., Editor, Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009, Seite 155-166
In Geske, U. and Wolf, A., Editor
Herausgeber: Universitätsverlag Potsdam
März 2010
39.
Betz, Hariolf; Raiser, Frank; Frühwirth, Thom
A Complete and Terminating Execution Model for Constraint Handling Rules
aus Ulmer Informatik-Berichte
Dokument Nummer: 2010-01
Universität Ulm
Januar 2010

2009

38.
Raiser, Frank; Frühwirth, Thom
Strong Joinability Analysis for Graph Transformation Systems in CHR
In Corradini, A., Editor, Proceedings of the Fifth International Workshop on Computing with Terms and Graphs (TERMGRAPH 2009)Band253ausElectronic Notes in Theoretical Computer Science, Seite 91-111
In Corradini, A., Editor
November 2009
DOI:10.1016/j.entcs.2009.10.019