Publications

of Jon Sneyers

Books and proceedings

  1. Henning Christiansen and Jon Sneyers, editors. CHR13l, July 2013. KULCW, Technical report CW 641. [WWW] [PDF] Keyword(s): CHR 2013.
  2. Jon Sneyers and Thom Frühwirth, editors. CHR12l, September 2012. KULCW, Technical report CW 624. [WWW] [PDF] Keyword(s): CHR 2012.
  3. Jon Sneyers, editor. CHR11l, September 2011. GUC, Technical report. [PDF] Keyword(s): CHR 2011.
  4. F. Raiser and J. Sneyers, editors. CHR09l, July 2009. KULCW, Technical report CW 555. Keyword(s): CHR 2009.

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.

Articles in journal, book chapters

  1. 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. TPLP, 10(1):1-47, 2010. [PDF] [doi:10.1017/S1471068409990123] Keyword(s): survey.
  2. 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.
  3. Jon Sneyers, Wannes Meert, Joost Vennekens, Yoshitaka Kameya, and Taisuke Sato. CHR(PRISM)-based Probabilistic Logic Learning. In Manuel Hermenegildo and Torsten Schaub, editors, ICLP10l, volume 10(4--6) of TPLP, pages 433-447. CUP, July 2010. [doi:10.1017/S1471068410000207] Keyword(s): probabilistic CHR, CHRiSM, extensions.
  4. 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.
  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 LNAI, pages 213-244. SV, December 2008. [WWW] [doi:10.1007/978-3-540-92243-8_8] Keyword(s): implementation, optimizing compilation.

Conference articles

  1. Jon Sneyers, Daniel De Schreye, and Thom Frühwirth. CHRiSM and Probabilistic Argumentation Logic. In Henning Christiansen and Jon Sneyers, editors, CHR13l, pages 39-52, July 2013. KULCW, Technical report CW 641. [WWW] [PDF] Keyword(s): CHRiSM, applications, CHR 2013, CHR 2013.
  2. Jon Sneyers and Danny De Schreye. Probabilistic Termination of CHRiSM Programs. In German Vidal, editor, LOPSTR11prel, 2011. Keyword(s): termination, CHRiSM, probabilistic CHR.
  3. 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, CHR10l, July 2010. KULCW, Technical report CW 588. [WWW] [PDF] Keyword(s): CHR 2010, CHRiSM, applications, CHR 2010, CHR 2010.
  4. Jon Sneyers. Result-directed CHR Execution. In P. Van Weert and L. De Koninck, editors, CHR10l, July 2010. KULCW, Technical report CW 588. [WWW] [PDF] Keyword(s): CHR 2010, CHRiSM, probabilistic CHR, CHR 2010, CHR 2010.
  5. 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.
  6. 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.
  7. Jon Sneyers, Wannes Meert, and Joost Vennekens. CHRiSM: Chance Rules induce Statistical Models. In F. Raiser and J. Sneyers, editors, CHR09l, pages 62-76, July 2009. KULCW, Technical report CW 555. [PDF] Keyword(s): CHR 2009, probabilistic CHR, CHRiSM, extensions , CHR 2009, CHR 2009.
  8. Peter Van Weert, Leslie De Koninck, and Jon Sneyers. A Proposal for a Next Generation of CHR. In F. Raiser and J. Sneyers, editors, CHR09l, pages 77-93, July 2009. KULCW, Technical report CW 555. [PDF] Keyword(s): CHR 2009, semantics, priorities, extensions, CHR 2009, CHR 2009.
  9. 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.
  10. Jon Sneyers and Thom Frühwirth. Generalized CHR Machines. In T. Schrijvers, F. Raiser, and T. Frühwirth, editors, CHR08l, pages 143-158, 2008. RISC Report Series 08-10, University of Linz, Austria. [PDF] Keyword(s): CHR 2008, complexity, CHR 2008, CHR 2008.
  11. Peter Van Weert, Jon Sneyers, and Bart Demoen. Aggregates for CHR through Program Transformation. In A. King, editor, LOPSTR07l, volume 4915 of LNCS, pages 59-73, 2008. [doi:10.1007/978-3-540-78769-3_5] Keyword(s): extensions.
  12. Leslie De Koninck and Jon Sneyers. Join Ordering for Constraint Handling Rules. In K. Djelloul, G. J. Duck, and M. Sulzmann, editors, CHR07l, pages 107-121, September 2007. [PDF] Keyword(s): optimizing compilation, CHR 2007, CHR 2007, CHR 2007.
  13. Jon Sneyers, Peter Van Weert, and Tom Schrijvers. Aggregates for Constraint Handling Rules. In K. Djelloul, G. J. Duck, and M. Sulzmann, editors, CHR07l, pages 91-105, September 2007. [PDF] Keyword(s): CHR 2007, extensions, CHR 2007, CHR 2007.
  14. Jon Sneyers, Peter Van Weert, Tom Schrijvers, and Bart Demoen. Aggregates in Constraint Handling Rules: Extended Abstract. In V. Dahl and I. Niemelä, editors, ICLP07l, volume 4670 of LNCS, pages 446-448, September 2007. SV. [doi:10.1007/978-3-540-74610-2_39] Keyword(s): extensions.
  15. 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.
  16. Jon Sneyers, Tom Schrijvers, and Bart Demoen. Memory reuse for CHR. In S. Etalle and M. Truszczynski, editors, ICLP06l, volume 4079 of LNCS, pages 72-86, August 2006. SV. [doi:10.1007/11799573_8] Keyword(s): implementation, optimizing compilation.
  17. Peter Van Weert, Jon Sneyers, Tom Schrijvers, and Bart Demoen. Extending CHR with Negation as Absence. In T. Schrijvers and Th. Frühwirth, editors, CHR06l, pages 125-140, July 2006. KULCW, Technical report CW 452. [POSTSCRIPT] Keyword(s): CHR 2006, extensions, CHR 2006, CHR 2006.
  18. Jon Sneyers, Tom Schrijvers, and Bart Demoen. Guard and Continuation Optimization for Occurrence Representations of CHR. In M. Gabbrielli and G. Gupta, editors, ICLP05l, volume 3668 of LNCS, pages 83-97, October 2005. SV. Keyword(s): implementation, optimizing compilation.
  19. 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.

Internal reports

  1. Jon Sneyers, Peter Van Weert, Tom Schrijvers, and Bart Demoen. Aggregates in CHR. Technical report CW 481, KULCW, Leuven, Belgium, March 2007. [WWW] Keyword(s): extensions.
  2. Peter Van Weert, Jon Sneyers, Tom Schrijvers, and Bart Demoen. To $\mathrm{CHR}^{\mbox{\large$\!\!\lnot$}}$ or not to $\mathrm{CHR}^{\mbox{\large$\!\!\lnot$}}$: Extending CHR with Negation as Absence. Technical report CW 446, KULCW, Leuven, Belgium, May 2006. [WWW] Keyword(s): extensions.

BACK TO INDEX