Hostname: page-component-745bb68f8f-b6zl4 Total loading time: 0 Render date: 2025-02-07T04:00:25.424Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimizing compilation of constraint handling rules in HAL

Published online by Cambridge University Press:  01 July 2005

CHRISTIAN HOLZBAUR ,
MARIA GARCIA DE LA BANDA ,
PETER J. STUCKEY  and
GREGORY J. DUCK
CHRISTIAN HOLZBAUR
Affiliation:
Department of Medical Cybernetics and Art. Intelligence, University of Vienna, Austria
MARIA GARCIA DE LA BANDA
Affiliation:
School of Computer Science & Software Engineering, Monash University, Australia
PETER J. STUCKEY
Affiliation:
NICTA Victoria Laboratory, Department of Computer Science & Software Engineering, University of Melbourne, Australia
GREGORY J. DUCK
Affiliation:
NICTA Victoria Laboratory, Department of Computer Science & Software Engineering, University of Melbourne, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper we discuss the optimizing compilation of Constraint Handling Rules (CHRs). 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 show how we can use different kinds of information in the compilation of CHRs to obtain access efficiency, and a better translation of the CHR rules into the underlying language, which in this case is HAL. 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 this information about functional dependencies, symmetries and other kinds of information supporting optimizations.

Keywords

constraint handling rulesoptimizing compilation
Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 5 , Issue 4-5 , July 2005 , pp. 503 - 531
Copyright
© 2005 Cambridge University Press

Footnotes

A preliminary version of this paper appeared under the title “Optimizing Compilation of Constraint Handling Rules” in ICLP 2001, Cyprus, November 2001 (Holzbaur et al. 2001).