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.

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

Articles in journal, book chapters

  1. Leslie De Koninck. Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities. TPLP, 9(2):165-212, March 2009. [doi:10.1017/S1471068409003664] Keyword(s): priorities, related formalisms, complexity.
  2. 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.

Conference articles

  1. Leonor Becerra-Bonache, Henning Christiansen, and M. Dolores Jiménez-López. A Gold Standard to Measure Relative Linguistic Complexity with a Grounded Language Learning Model. In Proceedings of the Workshop on Linguistic Complexity and Natural Language Processing, pages 1-9, 2018.
  2. Henning Christiansen and Amr Hany Saleh. Modeling Dependent Events with CHRiSM for Probabilistic Abduction. In Jon Sneyers, editor, CHR11l, pages 48-63, September 2011. GUC, Technical report. [PDF] Keyword(s): abduction, probabilistic CHR, CHRiSM, CHR 2011, CHR 2011.
  3. R. Haemmerlé, P. Lopez-Garcia, and M.V. Hermenegildo. CLP Projection for Constraint Handling Rules. In Michael Hanus, editor, PPDP11l, pages 137-148, July 2011. ACM. [doi:10.1145/2003476.2003496] Keyword(s): semantics, related formalisms, termination, confluence.
  4. 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, CHR10l, July 2010. KULCW, Technical report CW 588. [WWW] [PDF] Keyword(s): CHR 2010, applications, CHR 2010, CHR 2010.
  5. Peter Van Weert. Join Ordering for Constraint Handling Rules: Putting Theory into Practice. In P. Van Weert and L. De Koninck, editors, CHR10l, July 2010. KULCW, Technical report CW 588. [WWW] [PDF] Keyword(s): CHR 2010, implementation, optimizing compilation, CHR 2010, CHR 2010.
  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. 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.
  8. Beata Sarna-Starosta and Tom Schrijvers. Transformation-based Indexing Techniques for Constraint Handling Rules. In T. Schrijvers, F. Raiser, and T. Frühwirth, editors, CHR08l, 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.
  9. Tom Schrijvers and Martin Sulzmann. Transactions in Constraint Handling Rules. In M. Garcìa de la Banda and E. Pontelli, editors, ICLP08l, volume 5366 of LNCS, pages 516-530, December 2008. SV. [doi:10.1007/978-3-540-89982-2_44] Keyword(s): parallelism.
  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. 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 LNCS, pages 139-153, June 2006. SV. ISBN: 978-3-540-73816-9. [doi:10.1007/978-3-540-73817-6_9] Keyword(s): complexity, algorithms.
  12. Marc Meister and Thom Frühwirth. Complexity of the CHR Rational Tree Equation Solver. In T. Schrijvers and Th. Frühwirth, editors, CHR06l, pages 77-91, July 2006. KULCW, Technical report CW 452. [POSTSCRIPT] Keyword(s): CHR 2006, complexity, algorithms, CHR 2006, CHR 2006.
  13. Thom Frühwirth. Logical Rules for a Lexicographic Order Constraint Solver. In T. Schrijvers and Th. Frühwirth, editors, CHR05l, pages 79-91, 2005. KULCW, Technical report CW 421. [POSTSCRIPT] Keyword(s): CHR 2005, CHR 2005, CHR 2005.
  14. 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 UIB, pages 135-146, February 2005. [WWW] Keyword(s): algorithms, complexity.
  15. 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.
  16. 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 ENTCS, 2002. Elsevier. Keyword(s): complexity.
  17. 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. MK. Keyword(s): complexity.
  18. 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 ENTCS, pages 147-166, June 2001. Elsevier. Keyword(s): complexity, termination.

Internal reports

  1. Leslie De Koninck, Tom Schrijvers, and Bart Demoen. The Correspondence Between the Logical Algorithms Language and CHR. Technical report CW 480, KULCW, Leuven, Belgium, March 2007. [WWW] Keyword(s): related formalisms, priorities.
  2. Beata Sarna-Starosta and Tom Schrijvers. Indexing techniques for CHR based on program transformation. Technical report CW 500, KULCW, Leuven, Belgium, August 2007. [WWW] Keyword(s): implementation, optimizing compilation.

BACK TO INDEX