| 2009 |
| 10 | EE | Jon Sneyers,
Tom Schrijvers,
Bart Demoen:
The computational power and complexity of constraint handling rules.
ACM Trans. Program. Lang. Syst. 31(2): (2009) |
| 2008 |
| 9 | EE | Jon Sneyers:
Turing-Complete Subclasses of CHR.
ICLP 2008: 759-763 |
| 2007 |
| 8 | EE | Jon Sneyers,
Peter Van Weert,
Tom Schrijvers,
Bart Demoen:
Aggregates in Constraint Handling Rules.
ICLP 2007: 446-448 |
| 7 | EE | Peter Van Weert,
Jon Sneyers,
Bart Demoen:
Aggregates for CHR through Program Transformation.
LOPSTR 2007: 59-73 |
| 2006 |
| 6 | EE | Jon Sneyers,
Tom Schrijvers,
Bart Demoen:
Memory Reuse for CHR.
ICLP 2006: 72-86 |
| 5 | EE | Jon Sneyers,
Joost Vennekens,
Danny De Schreye:
Probabilistic-Logical Modeling of Music.
PADL 2006: 60-72 |
| 4 | EE | Jon Sneyers,
Tom Schrijvers,
Bart Demoen:
Dijkstra's Algorithm with Fibonacci Heaps: An Executable Description in CHR.
WLP 2006: 182-191 |
| 2005 |
| 3 | EE | Jon Sneyers:
Analysis and Optimization of CHR Programs.
ICLP 2005: 450-451 |
| 2 | EE | Jon Sneyers,
Tom Schrijvers,
Bart Demoen:
Guard and Continuation Optimization for Occurrence Representations of CHR.
ICLP 2005: 83-97 |
| 1 | | Jon Sneyers,
Tom Schrijvers,
Bart Demoen:
Guard Simplification in CHR programs.
W(C)LP 2005: 123-134 |