Advertisement

Optimizing Compilation and Computational Complexity of Constraint Handling Rules

Ph.D. Thesis Summary
  • Jon Sneyers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5649)

Abstract

Constraint Handling Rules [1,2] is a high-level programming language extension based on multi-headed committed-choice multiset rewrite rules. It can be used as a stand-alone language or as an extension to an existing host language. CHR systems have been implemented for nearly every Prolog system, and there are also CHR systems for Haskell, Java and C.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Frühwirth, T.: Constraint Handling Rules. Cambridge University Press, Cambridge (2009)CrossRefzbMATHGoogle Scholar
  2. 2.
    Sneyers, J., Van Weert, P., Schrijvers, T., De Koninck, L.: As time goes by: Constraint Handling Rules — A survey of CHR research between 1998 and 2007. In: Theory and Practice of Logic Programming (2009)Google Scholar
  3. 3.
    Schrijvers, T.: Analyses, optimizations and extensions of Constraint Handling Rules. Ph.D thesis, K.U.Leuven, Leuven, Belgium (June 2005)Google Scholar
  4. 4.
    Duck, G.J.: Compilation of Constraint Handling Rules. Ph.D thesis, University of Melbourne, Victoria, Australia (December 2005)Google Scholar
  5. 5.
    De Koninck, L.: Execution control for Constraint Handling Rules. Ph.D thesis, K.U.Leuven, Leuven, Belgium (November 2008)Google Scholar
  6. 6.
    Duck, G.J., Stuckey, P.J., García de la Banda, M., Holzbaur, C.: The refined operational semantics of Constraint Handling Rules. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 90–104. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Sneyers, J.: Optimizing Compilation and Computational Complexity of Constraint Handling Rules. Ph.D thesis, K.U.Leuven, Leuven, Belgium (November 2008)Google Scholar
  8. 8.
    Demoen, B., Nguyen, P.L.: So many WAM variations, so little time. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS, vol. 1861, pp. 1240–1254. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  9. 9.
    Sneyers, J., Schrijvers, T., Demoen, B.: The computational power and complexity of Constraint Handling Rules. ACM Trans. Program. Lang. Syst. 31(2) (2009)Google Scholar
  10. 10.
    Frühwirth, T.: As time goes by: Automatic complexity analysis of simplification rules. In: Proc. 8th Intl. Conf. Princ. Knowledge Representation and Reasoning, pp. 547–557. Morgan Kaufmann, San Francisco (2002)Google Scholar
  11. 11.
    Clavel, M., Durán, F., Eker, S., et al.: Maude: Specification and programming in rewriting logic. Theoretical Computer Science 285(2), 187–243 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Friedman-Hill, E.: Jess in Action: Java Rule-Based Systems. Manning Publications (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Jon Sneyers
    • 1
  1. 1.K.U. LeuvenBelgium

Personalised recommendations