Thesis
- 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.
Articles in journal, book chapters
- Maurizio Gabbrielli, Jacopo Mauro, Maria Chiara Meo, and Jon Sneyers. Decidability properties for fragments of CHR. In Manuel Hermenegildo and Torsten Schaub, editors, ICLP10l, volume 10(4--6) of TPLP, pages 611-626. CUP, July 2010. [doi:10.1017/S1471068410000311] Keyword(s): computability.
- Jon Sneyers, Tom Schrijvers, and Bart Demoen. The Computational Power and Complexity of Constraint Handling Rules. TOPLAS, 31(2), February 2009. [doi:10.1145/1462166.1462169] Keyword(s): complexity, computability.
Conference articles
- Jon Sneyers. Optimizing Compilation and Computational Complexity of Constraint Handling Rules -- Ph.D. thesis summary. In Patricia M. Hill and David S. Warren, editors, ICLP09l, volume 5649 of LNCS, pages 494-498, July 2009. SV. [doi:10.1007/978-3-642-02846-5_41] Keyword(s): implementation, optimizing compilation, complexity, computability.
- Jon Sneyers. Turing-complete Subclasses of CHR. In M. Garcìa de la Banda and E. Pontelli, editors, ICLP08l, volume 5366 of LNCS, pages 759-763, December 2008. SV. [doi:10.1007/978-3-540-89982-2_72] Keyword(s): computability.
- Jon Sneyers, Tom Schrijvers, and Bart Demoen. The Computational Power and Complexity of Constraint Handling Rules. In T. Schrijvers and Th. Frühwirth, editors, CHR05l, pages 3-17, 2005. KULCW, Technical report CW 421. [POSTSCRIPT] Keyword(s): CHR 2005, computability, complexity, CHR 2005, CHR 2005.
BACK TO INDEX