Skip to main content
SpringerLink
Log in

Optimizing Compilation of Constraint Handling Rules

  • Conference paper
  • First Online:
Book cover Logic Programming (ICLP 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2237))

Included in the following conference series:

Abstract

CHRs are a multi-headed committed choice constraint language, commonly applied for writing incremental constraint solvers. CHRs are usually implemented as a language extension that compiles to the underlying language. In this paper we discuss the optimizing compilation of Constraint Handling Rules (CHRs). In particualr, we show how we can use different kinds of information in the compilation of CHRs in order to obtain access efficiency, and a better translation of the CHR rules into the underlying language. The kinds of information used include the types, modes, determinism, functional dependencies and symmetries of the CHR constraints. We also show how to analyze CHR programs to determine information about functional dependencies, symmetries and other kinds of information supporting optimizations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abdennadher. Operational semantics and confluence of constraint propagation rules. In Proceedings of the Third International Conference on Principles and Practice of Constraint Programming, pages 252–266, 1997.

    Google Scholar 

  2. B. Demoen, M. García de la Banda, W. Harvey, K. Marriott, and P.J. Stuckey. An overview of HAL. In Proceedings of the Fourth International Conference on Principles and Practices of Constraint Programming, pages 174–188, 1999.

    Google Scholar 

  3. T. Frühwirth. Theory and practice of constraint handling rules. Journal of Logic Programming, 37(1–3):95–138, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  4. C. Holzbaur and T. Frühwirth. Constraint handling rules, special issue. Journal of Applied Artificial Intelligence, 14(4), 2000.

    Google Scholar 

  5. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury: an efficient purely declarative logic programming language. Journal of Logic Programming, 29:17–64, 1996.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Medical Cybernetics and Art. Intelligence, University of Vienna, Austria

    Christian Holzbaur

  2. School of Comp. Sci. & Soft. Eng., Monash University, Australia

    María García de la Banda & David Jeffery

  3. Dept. of Comp. Sci. & Soft. Eng., University of Melbourne, Australia

    Peter J. Stuckey

Authors
  1. Christian Holzbaur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. María García de la Banda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Jeffery
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Peter J. Stuckey
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LIP6, case 169, University of Paris 6, 8 rue du Capitaine Scott, 75015, Paris, France

    Philippe Codognet

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Holzbaur, C., de la Banda, M.G., Jeffery, D., Stuckey, P.J. (2001). Optimizing Compilation of Constraint Handling Rules. In: Codognet, P. (eds) Logic Programming. ICLP 2001. Lecture Notes in Computer Science, vol 2237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45635-X_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45635-X_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42935-7

  • Online ISBN: 978-3-540-45635-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation