Constraint Handling Rules (CHR) is a committed-choice rule-based language embedded in Prolog. It is designed for writing constraint solvers and is particularly useful for providing application-specific constraints. It has been used in many kinds of applications, like scheduling, model checking, abduction, and type checking, among many others. CHR has previously been implemented in other Prolog systems (SICStus, Eclipse, Yap), Haskell and Java. This CHR system is based on the compilation scheme and runtime environment of CHR in SICStus.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Frühwirth, Thom: Parallelism, concurrency and distribution in constraint handling rules: a survey (2018)
- Alberti, Marco; Gavanelli, Marco; Lamma, Evelina: Runtime addition of integrity constraints in an abductive proof procedure (2010)
- Schrijvers, Tom: Analyses, optimizations and extensions of Constraint Handling Rules: Ph.D. Summary (2005)
- Fruehwirth, Thom; Abdennadher, Slim: Tutorial: reasoning with, about and for constraint handling rules (2002)