Optimizing compilation of constraint handling rules

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

doi:10.1007/3-540-45635-X_13

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 proceeding › Conference Paper › Research › peer-review

11 Citations (Scopus)

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.

Original language	English
Title of host publication	Logic Programming
Subtitle of host publication	17th International Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings
Editors	Philippe Codognet
Place of Publication	Berlin Germany
Publisher	Springer
Pages	74-89
Number of pages	16
ISBN (Print)	3540429352
DOIs	https://doi.org/10.1007/3-540-45635-X_13
Publication status	Published - 2001
Event	International Conference on Logic Programming 2001 - Paphos, Cyprus Duration: 26 Nov 2001 → 1 Dec 2001 Conference number: 17th https://link.springer.com/book/10.1007/3-540-45635-X (Proceedings)

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	2237
ISSN (Print)	0302-9743

Conference

Conference	International Conference on Logic Programming 2001
Abbreviated title	ICLP 2001
Country/Territory	Cyprus
City	Paphos
Period	26/11/01 → 1/12/01
Internet address	https://link.springer.com/book/10.1007/3-540-45635-X (Proceedings)

Access to Document

10.1007/3-540-45635-X_13

Cite this

Holzbaur, C., Garcia De La Banda, M. J., Jeffery, D. G., & Stuckey, P. J. (2001). Optimizing compilation of constraint handling rules. In P. Codognet (Ed.), Logic Programming: 17th International Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings (pp. 74-89). (Lecture Notes in Computer Science; Vol. 2237). Springer. https://doi.org/10.1007/3-540-45635-X_13

@inproceedings{1d48c84c0e2543588a68442cb5b57e29,

title = "Optimizing compilation of constraint handling rules",

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

author = "Christian Holzbaur and {Garcia De La Banda}, {Maria Jose} and Jeffery, {David G} and Stuckey, {Peter J}",

year = "2001",

doi = "10.1007/3-540-45635-X_13",

language = "English",

isbn = "3540429352",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "74--89",

editor = "Philippe Codognet",

booktitle = "Logic Programming",

note = "International Conference on Logic Programming 2001, ICLP 2001 ; Conference date: 26-11-2001 Through 01-12-2001",

url = "https://link.springer.com/book/10.1007/3-540-45635-X",

}

Holzbaur, C, Garcia De La Banda, MJ, Jeffery, DG & Stuckey, PJ 2001, Optimizing compilation of constraint handling rules. in P Codognet (ed.), Logic Programming: 17th International Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings. Lecture Notes in Computer Science, vol. 2237, Springer, Berlin Germany, pp. 74-89, International Conference on Logic Programming 2001, Paphos, Cyprus, 26/11/01. https://doi.org/10.1007/3-540-45635-X_13

Optimizing compilation of constraint handling rules. / Holzbaur, Christian; Garcia De La Banda, Maria Jose; Jeffery, David G et al.
Logic Programming: 17th International Conference, ICLP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings. ed. / Philippe Codognet. Berlin Germany: Springer, 2001. p. 74-89 (Lecture Notes in Computer Science; Vol. 2237).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Optimizing compilation of constraint handling rules

AU - Holzbaur, Christian

AU - Garcia De La Banda, Maria Jose

AU - Jeffery, David G

AU - Stuckey, Peter J

N1 - Conference code: 17th

PY - 2001

Y1 - 2001

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

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

U2 - 10.1007/3-540-45635-X_13

DO - 10.1007/3-540-45635-X_13

M3 - Conference Paper

SN - 3540429352

T3 - Lecture Notes in Computer Science

SP - 74

EP - 89

BT - Logic Programming

A2 - Codognet, Philippe

PB - Springer

CY - Berlin Germany

T2 - International Conference on Logic Programming 2001

Y2 - 26 November 2001 through 1 December 2001

ER -