1. Jon Sneyers. Optimizing Compilation and Computational Complexity of Constraint Handling Rules. PhD thesis, K.U.Leuven, Belgium, November 2008. [WWW] [PDF] Keyword(s): implementation, optimizing compilation, complexity, computability. [Abstract] [bibtex-entry]

1. Maurizio Gabbrielli, Jacopo Mauro, Maria Chiara Meo, and Jon Sneyers. Decidability properties for fragments of CHR. In Manuel Hermenegildo and Torsten Schaub, editors, ICLP '10: Proc. 26th Intl. Conf. Logic Programming, volume 10(4–6) of Theory and Practice of Logic Programming, pages 611-626. Cambridge University Press, July 2010. [doi:10.1017/S1471068410000311] Keyword(s): computability. [bibtex-entry]



2. Jon Sneyers, Tom Schrijvers, and Bart Demoen. The Computational Power and Complexity of Constraint Handling Rules. ACM Trans. Program. Lang. Syst., 31(2), February 2009. [doi:10.1145/1462166.1462169] Keyword(s): complexity, computability. [bibtex-entry]

1. Jon Sneyers. Optimizing Compilation and Computational Complexity of Constraint Handling Rules – Ph.D. thesis summary. In Patricia M. Hill and David S. Warren, editors, ICLP '09: Proc. 25th Intl. Conf. Logic Programming, volume 5649 of Lecture Notes in Computer Science, pages 494-498, July 2009. Springer-Verlag. [doi:10.1007/978-3-642-02846-5_41] Keyword(s): implementation, optimizing compilation, complexity, computability. [bibtex-entry]



2. Jon Sneyers. Turing-complete Subclasses of CHR. In M. Garcìa de la Banda and E. Pontelli, editors, ICLP '08: Proc. 24rd Intl. Conf. Logic Programming, volume 5366 of Lecture Notes in Computer Science, pages 759-763, December 2008. Springer-Verlag. [doi:10.1007/978-3-540-89982-2_72] Keyword(s): computability. [bibtex-entry]



3. Jon Sneyers, Tom Schrijvers, and Bart Demoen. The Computational Power and Complexity of Constraint Handling Rules. In T. Schrijvers and Th. Frühwirth, editors, CHR '05: Proc. 2nd Workshop on Constraint Handling Rules, pages 3-17, 2005. K.U.Leuven, Department of Computer Science, Technical report CW 421. [POSTSCRIPT] Keyword(s): CHR 2005, computability, complexity, CHR 2005, CHR 2005. [Abstract] [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