1. K. Djelloul, G. J. Duck, and M. Sulzmann, editors. CHR '07: Proc. 4th Workshop on Constraint Handling Rules, September 2007. Keyword(s): CHR 2007. [bibtex-entry]

1. Khalil Djelloul, Dao Thi-Bich-Hanh, and Thom Frühwirth. Theory of finite or infinite trees revisited. Theory and Practice of Logic Programming, 8(4):431-489, 2008. [doi:10.1017/S1471068407003171] [Abstract] [bibtex-entry]

1. Khalil Djelloul, Thi-Bich-Hanh Dao, and Thom Frühwirth. Toward a first-order extension of Prolog's unification using CHR: a CHR first-order constraint solver over finite or infinite trees. In SAC '07: Proc. 2007 ACM Symp. Applied computing, pages 58-64, 2007. ACM Press. [bibtex-entry]



2. Marc Meister, Khalil Djelloul, and Jacques Robin. A Unified Semantics for Constraint Handling Rules in Transaction Logic. In C. Baral, G. Brewka, and J. S. Schlipf, editors, LPNMR '07: Proc. 9th Intl. Conf. Logic Programming and Nonmonotonic Reasoning, volume 4483 of Lecture Notes in Computer Science, pages 201-213, May 2007. Springer-Verlag. [doi:10.1007/978-3-540-72200-7_18] Keyword(s): semantics. [bibtex-entry]



3. 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. [doi:10.1007/978-3-540-73817-6_9] Keyword(s): complexity, algorithms. [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