BACK TO INDEX

Publications of Jon Sneyers
Books and proceedings
  1. Jon Sneyers, editor. CHR '11: Proc. 8th Workshop on Constraint Handling Rules, September 2011. GUC, Technical report. [PDF] Keyword(s): CHR 2011. [bibtex-entry]


  2. F. Raiser and J. Sneyers, editors. CHR '09: Proc. 6th Workshop on Constraint Handling Rules, July 2009. K.U.Leuven, Department of Computer Science, Technical report CW 555. Keyword(s): CHR 2009. [bibtex-entry]


Thesis
  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]


Articles in journal or book chapters
  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, Wannes Meert, Joost Vennekens, Yoshitaka Kameya, and Taisuke Sato. CHR(PRISM)-based Probabilistic Logic Learning. 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 433-447. Cambridge University Press, July 2010. [doi:10.1017/S1471068410000207] Keyword(s): probabilistic CHR, CHRiSM, extensions. [bibtex-entry]


  3. Jon Sneyers, Peter Van Weert, Tom Schrijvers, and Leslie De Koninck. As Time Goes By: Constraint Handling Rules – A Survey of CHR Research between 1998 and 2007. Theory and Practice of Logic Programming, 10(1):1-47, 2010. [PDF] [doi:10.1017/S1471068409990123] Keyword(s): survey. [Abstract] [bibtex-entry]


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


  5. Jon Sneyers, Tom Schrijvers, and Bart Demoen. Guard Reasoning in the Refined Operational Semantics of CHR. In Tom Schrijvers and Thom Frühwirth, editors, Constraint Handling Rules — Current Research Topics, volume 5388 of Lecture Notes in Artificial Intelligence, pages 213-244. Springer-Verlag, December 2008. [WWW] [doi:10.1007/978-3-540-92243-8_8] Keyword(s): implementation, optimizing compilation. [bibtex-entry]


Conference articles
  1. Jon Sneyers and Danny De Schreye. Probabilistic Termination of CHRiSM Programs. In German Vidal, editor, LOPSTR '11: 21st Intl. Symp. Logic-Based Program Synthesis and Transformation, Pre-Proceedings, 2011. Keyword(s): termination, CHRiSM, probabilistic CHR. [bibtex-entry]


  2. Florian Geiselhart, Frank Raiser, Jon Sneyers, and Thom Frühwirth. MTSeq – Multi-touch-enabled music generation and manipulation based on CHR. In P. Van Weert and L. De Koninck, editors, CHR '10: Proc. 7th Workshop on Constraint Handling Rules, July 2010. K.U.Leuven, Department of Computer Science, Technical report CW 588. [WWW] [PDF] Keyword(s): CHR 2010, CHRiSM, applications, CHR 2010, CHR 2010. [Abstract] [bibtex-entry]


  3. Jon Sneyers. Result-directed CHR Execution. In P. Van Weert and L. De Koninck, editors, CHR '10: Proc. 7th Workshop on Constraint Handling Rules, July 2010. K.U.Leuven, Department of Computer Science, Technical report CW 588. [WWW] [PDF] Keyword(s): CHR 2010, CHRiSM, probabilistic CHR, CHR 2010, CHR 2010. [Abstract] [bibtex-entry]


  4. Jon Sneyers and Danny De Schreye. APOPCALEAPS: Automatic Music Generation with CHRiSM. In G. Danoy and others, editors, 22nd Benelux Conference on Artificial Intelligence (BNAIC 2010), Luxembourg, October 2010. Keyword(s): CHRiSM, applications. [Abstract] [bibtex-entry]


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


  6. Jon Sneyers, Wannes Meert, and Joost Vennekens. CHRiSM: Chance Rules induce Statistical Models. In F. Raiser and J. Sneyers, editors, CHR '09: Proc. 6th Workshop on Constraint Handling Rules, pages 62-76, July 2009. K.U.Leuven, Department of Computer Science, Technical report CW 555. [PDF] Keyword(s): CHR 2009, probabilistic CHR, CHRiSM, extensions , CHR 2009, CHR 2009. [Abstract] [bibtex-entry]


  7. Peter Van Weert, Leslie De Koninck, and Jon Sneyers. A Proposal for a Next Generation of CHR. In F. Raiser and J. Sneyers, editors, CHR '09: Proc. 6th Workshop on Constraint Handling Rules, pages 77-93, July 2009. K.U.Leuven, Department of Computer Science, Technical report CW 555. [PDF] Keyword(s): CHR 2009, semantics, priorities, extensions, CHR 2009, CHR 2009. [Abstract] [bibtex-entry]


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


  9. Jon Sneyers and Thom Frühwirth. Generalized CHR Machines. In T. Schrijvers, F. Raiser, and T. Frühwirth, editors, CHR '08: Proc. 5th Workshop on Constraint Handling Rules, pages 143-158, 2008. RISC Report Series 08-10, University of Linz, Austria. [PDF] Keyword(s): CHR 2008, complexity, CHR 2008, CHR 2008. [Abstract] [bibtex-entry]


  10. Peter Van Weert, Jon Sneyers, and Bart Demoen. Aggregates for CHR through Program Transformation. In A. King, editor, LOPSTR '07: 17th Intl. Symp. Logic-Based Program Synthesis and Transformation, Revised Selected Papers, volume 4915 of Lecture Notes in Computer Science, pages 59-73, 2008. [doi:10.1007/978-3-540-78769-3_5] Keyword(s): extensions. [bibtex-entry]


  11. Leslie De Koninck and Jon Sneyers. Join Ordering for Constraint Handling Rules. In K. Djelloul, G. J. Duck, and M. Sulzmann, editors, CHR '07: Proc. 4th Workshop on Constraint Handling Rules, pages 107-121, September 2007. [PDF] Keyword(s): optimizing compilation, CHR 2007, CHR 2007, CHR 2007. [Abstract] [bibtex-entry]


  12. Jon Sneyers, Peter Van Weert, and Tom Schrijvers. Aggregates for Constraint Handling Rules. In K. Djelloul, G. J. Duck, and M. Sulzmann, editors, CHR '07: Proc. 4th Workshop on Constraint Handling Rules, pages 91-105, September 2007. [PDF] Keyword(s): CHR 2007, extensions, CHR 2007, CHR 2007. [Abstract] [bibtex-entry]


  13. Jon Sneyers, Peter Van Weert, Tom Schrijvers, and Bart Demoen. Aggregates in Constraint Handling Rules: Extended Abstract. In V. Dahl and I. Niemelä, editors, ICLP '07: Proc. 23rd Intl. Conf. Logic Programming, volume 4670 of Lecture Notes in Computer Science, pages 446-448, September 2007. Springer-Verlag. [doi:10.1007/978-3-540-74610-2_39] Keyword(s): extensions. [bibtex-entry]


  14. Jon Sneyers, Tom Schrijvers, and Bart Demoen. Dijkstra's Algorithm with Fibonacci Heaps: An Executable Description in CHR. In M. Fink, H. Tompits, and S. Woltran, editors, WLP '06: Proc. 20th Workshop on Logic Programming, T.U.Wien, Austria, INFSYS Research report 1843-06-02, pages 182-191, February 2006. Keyword(s): algorithms. [bibtex-entry]


  15. Jon Sneyers, Tom Schrijvers, and Bart Demoen. Memory reuse for CHR. In S. Etalle and M. Truszczynski, editors, ICLP '06: Proc. 22nd Intl. Conf. Logic Programming, volume 4079 of Lecture Notes in Computer Science, pages 72-86, August 2006. Springer-Verlag. [doi:10.1007/11799573_8] Keyword(s): implementation, optimizing compilation. [Abstract] [bibtex-entry]


  16. Peter Van Weert, Jon Sneyers, Tom Schrijvers, and Bart Demoen. Extending CHR with Negation as Absence. In T. Schrijvers and Th. Frühwirth, editors, CHR '06: Proc. 3rd Workshop on Constraint Handling Rules, pages 125-140, July 2006. K.U.Leuven, Department of Computer Science, Technical report CW 452. [POSTSCRIPT] Keyword(s): CHR 2006, extensions, CHR 2006, CHR 2006. [Abstract] [bibtex-entry]


  17. Jon Sneyers, Tom Schrijvers, and Bart Demoen. Guard and Continuation Optimization for Occurrence Representations of CHR. In M. Gabbrielli and G. Gupta, editors, ICLP '05: Proc. 21st Intl. Conf. Logic Programming, volume 3668 of Lecture Notes in Computer Science, pages 83-97, October 2005. Springer-Verlag. Keyword(s): implementation, optimizing compilation. [bibtex-entry]


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


Internal reports
  1. 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]


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



BACK TO INDEX

Disclaimer:

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.

Last modified: Mon May 21 14:03:16 2012
This bibliography was compiled by the following authors:

This document was translated from BibTEX by bibtex2html