✍ Scribed by Thom Frühwirth
No coin nor oath required. For personal study only.
Constraint Handling Rules (CHR) are our proposal to allow more ¯exibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-de®ned constraints. CHR are essentially a committedchoice language consisting of multi-headed gurded rules that rewrite constraints into simpler ones until they are solved. In this broad survey we aim at covering all aspects of CHR as they currently present themselves. Going from theory to practice, we will de®ne syntax and semantics for CHR, introduce an important decidable property, con¯uence, of CHR programs and de®ne a tight integration of CHR with constraint logic programming languages. This survey then describes implementations of the language before we review several constraint solvers ± both traditional and nonstandard ones ± written in the CHR language. Finally we introduce two innovative applications that bene®ted from using CHR.
📜 SIMILAR VOLUMES