Optimizing compilation of constraint handling rules

Christian Holzbaur, Maria Jose Garcia De La Banda, David G Jeffery, Peter J Stuckey

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

    11 Citations (Scopus)


    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.
    Original languageEnglish
    Title of host publicationLogic Programming
    Subtitle of host publication17th International Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings
    EditorsPhilippe Codognet
    Place of PublicationBerlin Germany
    Number of pages16
    ISBN (Print)3540429352
    Publication statusPublished - 2001
    EventInternational Conference on Logic Programming 2001 - Paphos, Cyprus
    Duration: 26 Nov 20011 Dec 2001
    Conference number: 17th
    https://link.springer.com/book/10.1007/3-540-45635-X (Proceedings)

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743


    ConferenceInternational Conference on Logic Programming 2001
    Abbreviated titleICLP 2001
    Internet address

    Cite this