1. Hariolf Betz, Frank Raiser, and Thom Frühwirth. A complete and terminating execution model for Constraint Handling Rules. Ulmer Informatik Berichte 2010-01, Ulm University, Germany, January 2010. [WWW] Keyword(s): semantics, termination. [Abstract] [bibtex-entry]



2. Pierre Deransart and Rafael Oliveira. Towards a Generic Framework to Generate Explanatory Traces of Constraint Solving and Rule-Based Reasoning. Technical report 7165, INRIA, Paris – Rocquenfourt, December 2010. [WWW] Keyword(s): applications. [Abstract] [bibtex-entry]

1. Paolo Pilozzi and Danny De Schreye. Scaling termination proofs by a characterization of cycles in CHR. Technical report CW 541, K.U.Leuven, Department of Computer Science, Leuven, Belgium, April 2009. [WWW] Keyword(s): termination . [Abstract] [bibtex-entry]

1. Frank Raiser. Semi-automatic generation of CHR solvers from global constraint automata. Ulmer Informatik Berichte 2008-03, Ulm University, Germany, February 2008. [WWW] Keyword(s): program generation. [bibtex-entry]



2. Peter Van Weert. Compiling Constraint Handling Rules to Java: A Reconstruction. Technical report CW 521, K.U.Leuven, Department of Computer Science, Leuven, Belgium, August 2008. [WWW] Keyword(s): Java. [Abstract] [bibtex-entry]



3. Peter Van Weert. Optimization of CHR Propagation Rules: Extended report. Technical report CW 519, K.U.Leuven, Department of Computer Science, Leuven, Belgium, August 2008. [WWW] Keyword(s): implementation, optimizing compilation. [Abstract] [bibtex-entry]



4. Dean Voets, Paolo Pilozzi, and Danny De Schreye. A new approach to termination analysis of CHR. Technical report CW 506, K.U.Leuven, Department of Computer Science, Leuven, Belgium, January 2008. [WWW] Keyword(s): termination. [Abstract] [bibtex-entry]

1. Leslie De Koninck, Tom Schrijvers, and Bart Demoen. CHR^rp: Constraint Handling Rules with rule priorties. Technical report CW 479, K.U.Leuven, Department of Computer Science, Leuven, Belgium, March 2007. [WWW] Keyword(s): priorities. [Abstract] [bibtex-entry]



2. Leslie De Koninck, Tom Schrijvers, and Bart Demoen. The Correspondence Between the Logical Algorithms Language and CHR. Technical report CW 480, K.U.Leuven, Department of Computer Science, Leuven, Belgium, March 2007. [WWW] Keyword(s): related formalisms, priorities. [Abstract] [bibtex-entry]



3. Leslie De Koninck, Peter J. Stuckey, and Gregory J. Duck. Optimized compilation of CHR^rp. Technical report CW 499, K.U.Leuven, Department of Computer Science, Leuven, Belgium, August 2007. [WWW] Keyword(s): implementation, optimizing compilation, priorities. [Abstract] [bibtex-entry]



4. Paolo Pilozzi, Tom Schrijvers, and Danny De Schreye. Proving termination of CHR in Prolog: A transformational approach. Technical report CW 487, K.U.Leuven, Department of Computer Science, Leuven, Belgium, April 2007. [WWW] Keyword(s): termination. [Abstract] [bibtex-entry]



5. Beata Sarna-Starosta and Tom Schrijvers. Indexing techniques for CHR based on program transformation. Technical report CW 500, K.U.Leuven, Department of Computer Science, Leuven, Belgium, August 2007. [WWW] Keyword(s): implementation, optimizing compilation. [Abstract] [bibtex-entry]



6. Jon Sneyers, Peter Van Weert, Tom Schrijvers, and Bart Demoen. Aggregates in CHR. Technical report CW 481, K.U.Leuven, Department of Computer Science, Leuven, Belgium, March 2007. [WWW] Keyword(s): extensions. [Abstract] [bibtex-entry]

1. Peter Van Weert, Jon Sneyers, Tom Schrijvers, and Bart Demoen. To CHR^¬ or not to CHR^¬: Extending CHR with Negation as Absence. Technical report CW 446, K.U.Leuven, Department of Computer Science, Leuven, Belgium, May 2006. [WWW] Keyword(s): extensions. [Abstract] [bibtex-entry]

1. Tom Schrijvers and Bart Demoen. Antimonotony-based Delay Avoidance for CHR. Technical report CW 385, K.U.Leuven, Department of Computer Science, Leuven, Belgium, July 2004. [WWW] Keyword(s): implementation, optimizing compilation. [Abstract] [bibtex-entry]

1. Martin Sulzmann. TIE: A CHR-based Type Inference Engine. Technical report TR2001/27, University of Melbourne, Department of Computer Science, 2001. Keyword(s): type systems. [bibtex-entry]

1. Christian Holzbaur and Thom Frühwirth. Constraint Handling Rules reference manual, Release 2.2. Technical report TR-98-01, Österreichisches Forschungsinstitut für Artificial Intelligence, Wien, 1998. [bibtex-entry]

1. Thom Frühwirth and Pascal Brisset. High-Level Implementations of Constraint Handling Rules. Technical report ECRC-95-20, European Computer-Industry Research Centre, Munchen, Germany, 1995. [bibtex-entry]

1. Thom Frühwirth. Temporal Reasoning with Constraint Handling Rules. Technical report ECRC-94-5, European Computer-Industry Research Centre, Munchen, Germany, 1994. [bibtex-entry]

1. G. Dondosolla. A constraint-based implementation of the GRF. ESPRIT project no. 2409 EQUATOR Report, 1993. [bibtex-entry]

1. Thom Frühwirth. Constraint Simplification Rules. Technical report ECRC-92-18, European Computer-Industry Research Centre, Munchen, Germany, July 1992. [bibtex-entry]

1. Thom Frühwirth. Introducing Simplification Rules. Technical report ECRC-LP-63, European Computer-Industry Research Centre, Munchen, Germany, October 1991. Note: Presented at the Workshop Logisches Programmieren, Goosen/Berlin, Germany, October 1991 and the Workshop on Rewriting and Constraints, Dagstuhl, Germany, October 1991. [bibtex-entry]

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

The contents of this webpage is provided by the authors stated below. KU Leuven is not bound by the information provided. It is possible that the information is not or no longer completely accurate. Where necessary, the authors can adjust and update faulty information. The authors have taken all reasonable care to ensure that all information available on this website is accurate at the time of publication and on the basis of the current state of knowledge. KU Leuven nor the authors are responsible for the content of any links to external organisations that are referred to on this website.

• Peter Van Weert [home, mail]
• Jon Sneyers [home, mail]
• Tom Schrijvers [home, mail]
• Leslie De Koninck

This document was translated from BibT_EX by bibtex2html