BACK TO INDEX

Publications about 'complexity'
Books and proceedings
  1. Thom Frühwirth and Frank Raiser, editors. Constraint Handling Rules: Compilation, Execution, and Analysis. March 2011. ISBN: 978-3-83-911591-6. Keyword(s): implementation, complexity, optimizing compilation, parallelism, priorities. [bibtex-entry]


Thesis
  1. Frank Raiser. Graph Transformation Systems in Constraint Handling Rules: Improved Methods for Program Analysis. PhD thesis, Ulm University, Germany, November 2010. [WWW] [PDF] Keyword(s): Graph Transformation Systems, related formalisms. [Abstract] [bibtex-entry]


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


  3. 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, book chapters
  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. 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]


Conference articles
  1. Henning Christiansen and Amr Hany Saleh. Modeling Dependent Events with CHRiSM for Probabilistic Abduction. In Jon Sneyers, editor, CHR '11: Proc. 8th Workshop on Constraint Handling Rules, pages 48-63, September 2011. GUC, Technical report. [PDF] Keyword(s): abduction, probabilistic CHR, CHRiSM, CHR 2011, CHR 2011. [Abstract] [bibtex-entry]


  2. R. Haemmerlé, P. Lopez-Garcia, and M.V. Hermenegildo. CLP Projection for Constraint Handling Rules. In Michael Hanus, editor, PPDP '11: Proc. 13th Intl. Conf. Princ. Pract. Declarative Programming, pages 137-148, July 2011. ACM Press. [doi:10.1145/2003476.2003496] Keyword(s): semantics, related formalisms, termination, confluence. [Abstract] [bibtex-entry]


  3. Henning Christiansen, Christian Theil Have, Ole Torp Lassen, and Matthieu Petit. The Viterbi Algorithm expressed in Constraint Handling Rules. 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, applications, CHR 2010, CHR 2010. [Abstract] [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. 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. 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]


  7. Beata Sarna-Starosta and Tom Schrijvers. Transformation-based Indexing Techniques for Constraint Handling Rules. In T. Schrijvers, F. Raiser, and T. Frühwirth, editors, CHR '08: Proc. 5th Workshop on Constraint Handling Rules, pages 3-18, 2008. RISC Report Series 08-10, University of Linz, Austria. [PDF] Keyword(s): implementation, optimizing compilation, CHR 2008, CHR 2008, CHR 2008. [Abstract] [bibtex-entry]


  8. Tom Schrijvers and Martin Sulzmann. Transactions in Constraint Handling Rules. 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 516-530, December 2008. Springer-Verlag. [doi:10.1007/978-3-540-89982-2_44] Keyword(s): parallelism. [Abstract] [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. 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]


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


  12. Thom Frühwirth. Logical Rules for a Lexicographic Order Constraint Solver. In T. Schrijvers and Th. Frühwirth, editors, CHR '05: Proc. 2nd Workshop on Constraint Handling Rules, pages 79-91, 2005. K.U.Leuven, Department of Computer Science, Technical report CW 421. [POSTSCRIPT] Keyword(s): CHR 2005, CHR 2005, CHR 2005. [Abstract] [bibtex-entry]


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


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


  15. Thom Frühwirth. As Time Goes By II: More Automatic Complexity Analysis of Concurrent Rule Programs. In A. Di Pierro and H. Wiklicky, editors, QAPL '01: Proc. First Intl. Workshop on Quantitative Aspects of Programming Languages, volume 59(3) of Electronic Notes in Theoretical Computer Science, 2002. Elsevier. Keyword(s): complexity. [bibtex-entry]


  16. Thom Frühwirth. As Time Goes By: Automatic Complexity Analysis of Simplification Rules. In D. Fensel, F. Giunchiglia, D. McGuinness, and M.-A. Williams, editors, KR '02: Proc. 8th Intl. Conf. Princ. Knowledge Representation and Reasoning, pages 547-557, April 2002. Morgan Kaufmann. Keyword(s): complexity. [bibtex-entry]


  17. Thom Frühwirth. On the Number of Rule Applications in Constraint Programs. In A. Dovier, M. Chiara Meo, and A. Omicini, editors, Declarative Programming - Selected Papers from AGP 2000, volume 48 of Electronic Notes in Theoretical Computer Science, pages 147-166, June 2001. Elsevier. Keyword(s): complexity, termination. [bibtex-entry]


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


  2. Beata Sarna-Starosta and Tom Schrijvers. Indexing techniques for CHR based on program transformation. Technical report CW 500, K.U.Leuven, Department of Computer Science, Leuven, Belgium, August 2007. [WWW] Keyword(s): implementation, optimizing compilation. [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 Dec 16 13:19:48 2013
This bibliography was compiled by the following authors: Please send BibTEX entries of missing CHR-related publications to Jon Sneyers.

This document was translated from BibTEX by bibtex2html