1. Leslie De Koninck. Execution Control for Constraint Handling Rules. PhD thesis, K.U.Leuven, Belgium, November 2008. [WWW] [PDF] Keyword(s): priorities, complexity, related formalisms. [Abstract] [bibtex-entry]

1. Leslie De Koninck. Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities. Theory and Practice of Logic Programming, 9(2):165-212, March 2009. [doi:10.1017/S1471068409003664] Keyword(s): priorities, related formalisms, complexity. [Abstract] [bibtex-entry]



2. Martin Sulzmann and Peter J. Stuckey. HM(X) Type Inference is CLP(X) Solving. Journal of Functional Programming, 18(2):251-283, 2008. [doi:10.1017/S0956796807006569] Keyword(s): type systems. [Abstract] [bibtex-entry]



3. Tom Schrijvers and Thom Frühwirth. Optimal union-find in Constraint Handling Rules. Theory and Practice of Logic Programming, 6(1–2):213-224, 2006. ISSN: 1471-0684. [doi:10.1017/S1471068405002541] Keyword(s): algorithms. [bibtex-entry]

1. Alia El Bolock, Amira Zaki, and Thom Frühwirth. Substitution-based CHR Solver for Bivariate Binomial Equation Sets. In Jon Sneyers and Thom Frühwirth, editors, CHR '12: Proc. 9th Workshop on Constraint Handling Rules, pages 41-50, September 2012. K.U.Leuven, Department of Computer Science, Technical report CW 624. [WWW] [PDF] Keyword(s): applications, algorithms, CHR 2012, CHR 2012, CHR 2012, CHR 2012. [Abstract] [bibtex-entry]



2. J. Cheney. Satisfiability algorithms for conjunctive queries over trees. In Proceedings of the 14th International Conference on Database Theory, pages 150-161, 2011. ACM. [bibtex-entry]



3. Slim Abdennadher, Haythem Ismail, and Frederick Khoury. Transforming Imperative Algorithms to Constraint Handling Rules. In A. Wolf and U. Geske, editors, WLP '09: Proc. 23rd Workshop on (Constraint) Logic Programming, 2010. Universität Potsdam. [WWW] [bibtex-entry]



4. Peter Van Weert. Join Ordering for Constraint Handling Rules: Putting Theory into Practice. 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, implementation, optimizing compilation, CHR 2010, CHR 2010. [Abstract] [bibtex-entry]



5. François Degrave, Tom Schrijvers, and Wim Vanhoof. Automatic generation of test inputs for Mercury. In M. Hanus, editor, LOPSTR '08: 18th Intl. Symp. Logic-Based Program Synthesis and Transformation, Revised Selected Papers, volume 5438 of Lecture Notes in Computer Science, 2009. Springer-Verlag. [doi:10.1007/978-3-642-00515-2] Keyword(s): applications, testing. [Abstract] [bibtex-entry]



6. Marco Gavanelli, Marco Alberti, and Evelina Lamma. Integration of abductive reasoning and constraint optimization in SCIFF. 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 387-401, July 2009. Springer-Verlag. [doi:10.1007/978-3-642-02846-5_32] Keyword(s): abduction. [Abstract] [bibtex-entry]



7. Thom Frühwirth. Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR. In Recent Advances in Constraints — CSCLP '07: 12th ERCIM Intl. Workshop on Constraint Solving and Constraint Logic Programming, Revised Selected Papers, pages 91-118, November 2008. [doi:10.1007/978-3-540-89812-2_7] Keyword(s): algorithms. [Abstract] [bibtex-entry]



8. Frank Raiser. Semi-automatic generation of CHR solvers from global constraint automata. In Peter J. Stuckey, editor, CP' 08: Proc. 14th Intl. Conf. Princ. Pract. Constraint Programming, volume 5202 of Lecture Notes in Computer Science, pages 588-592, September 2008. Springer-Verlag. [doi:10.1007/978-3-540-85958-1_47] Keyword(s): program generation. [Abstract] [bibtex-entry]



9. Anders Schack-Nielsen and Carsten Schürmann. The CHR-Celf Connection. In T. Schrijvers, F. Raiser, and T. Frühwirth, editors, CHR '08: Proc. 5th Workshop on Constraint Handling Rules, pages 1-2, 2008. RISC Report Series 08-10, University of Linz, Austria. Note: Invited Talk. [PDF] Keyword(s): CHR 2008, related formalisms, CHR 2008, CHR 2008. [Abstract] [bibtex-entry]



10. Leslie De Koninck, Tom Schrijvers, and Bart Demoen. The Correspondence Between the Logical Algorithms Language and CHR. In V. Dahl and I. Niemelä, editors, ICLP '07: Proc. 23rd Intl. Conf. Logic Programming, volume 4670 of Lecture Notes in Computer Science, pages 209-223, September 2007. Springer-Verlag. [doi:10.1007/978-3-540-74610-2_15] Keyword(s): related formalisms. [bibtex-entry]



11. Marc Meister. Concurrency of the preflow-push algorithm in Constraint Handling Rules. In CSCLP'07: Proc. 12th Intl. Workshop on Constraint Solving and Constraint Logic Programming, pages 160-169, 2007. Keyword(s): algorithms, parallelism. [bibtex-entry]



12. Armin Wolf, Jacques Robin, and Jairson Vitorino. Adaptive CHR meets CHR^∨: An Extended Refined Operational Semantics for CHR^∨ Based On Justifications. In K. Djelloul, G. J. Duck, and M. Sulzmann, editors, CHR '07: Proc. 4th Workshop on Constraint Handling Rules, pages 1-15, September 2007. [PDF] Keyword(s): semantics, disjunction, CHR 2007, CHR 2007, CHR 2007. [Abstract] [bibtex-entry]



13. Thom Frühwirth. Deriving Linear-Time Algorithms from Union-Find in CHR. In T. Schrijvers and Th. Frühwirth, editors, CHR '06: Proc. 3rd Workshop on Constraint Handling Rules, pages 49-60, July 2006. K.U.Leuven, Department of Computer Science, Technical report CW 452. [POSTSCRIPT] Keyword(s): CHR 2006, algorithms, CHR 2006, CHR 2006. [Abstract] [bibtex-entry]



14. Marc Meister. Fine-grained Parallel Implementation of the Preflow-Push Algorithm 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 172-181, February 2006. Keyword(s): algorithms, parallelism. [bibtex-entry]



15. Marc Meister, Khalil Djelloul, and Thom Frühwirth. Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees. In F. Azevedo and others, editors, CSCLP '06: Proc. 11th Annual ERCIM Workshop on Constraint Solving and Constraint Programming, volume 4651 of Lecture Notes in Computer Science, pages 139-153, June 2006. Springer-Verlag. ISBN: 978-3-540-73816-9. [doi:10.1007/978-3-540-73817-6_9] Keyword(s): complexity, algorithms. [bibtex-entry]



16. Marc Meister and Thom Frühwirth. Complexity of the CHR Rational Tree Equation Solver. In T. Schrijvers and Th. Frühwirth, editors, CHR '06: Proc. 3rd Workshop on Constraint Handling Rules, pages 77-91, July 2006. K.U.Leuven, Department of Computer Science, Technical report CW 452. [POSTSCRIPT] Keyword(s): CHR 2006, complexity, algorithms, CHR 2006, CHR 2006. [Abstract] [bibtex-entry]



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



18. Thom Frühwirth. Parallelizing Union-Find in Constraint Handling Rules Using Confluence. In M. Gabbrielli and G. Gupta, editors, ICLP '05: Proc. 21st Intl. Conf. Logic Programming, volume 3668 of Lecture Notes in Computer Science, pages 113-127, October 2005. Springer-Verlag. Keyword(s): confluence, algorithms, parallelism. [bibtex-entry]



19. Tom Schrijvers and Thom Frühwirth. Analysing the CHR Implementation of Union-Find. In A. Wolf, Th. Frühwirth, and M. Meister, editors, W(C)LP '05: Proc. 19th Workshop on (Constraint) Logic Programming, volume 2005-01 of Ulmer Informatik-Berichte, pages 135-146, February 2005. [WWW] Keyword(s): algorithms, complexity. [bibtex-entry]



20. Liviu Badea and Doina Tilivea. Intelligent Information Integration as a Constraint Handling Problem. In FQAS '02: Proc. 5th Intl. Conf. on Flexible Query Answer Systems, volume 2522 of Lecture Notes in Computer Science, October 2002. Springer-Verlag. [doi:10.1007/3-540-36109-X_2] [Abstract] [bibtex-entry]



21. Harald Ganzinger and David A. McAllester. Logical Algorithms. In P. J. Stuckey, editor, ICLP '02: Proc. 18th Intl. Conf. Logic Programming, volume 2401 of Lecture Notes in Computer Science, pages 209-223, jul/aug 2002. Springer-Verlag. Keyword(s): related formalisms. [bibtex-entry]

1. Leslie De Koninck, Tom Schrijvers, and Bart Demoen. The Correspondence Between the Logical Algorithms Language and CHR. Technical report CW 480, K.U.Leuven, Department of Computer Science, Leuven, Belgium, March 2007. [WWW] Keyword(s): related formalisms, priorities. [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