Constraint Handling Rules (CHR) is a concurrent committed-choice constraint logic programming language. It consists of guarded rules that transform multi-sets of atomic formulas (constraints) until exhaustion. In CHR, one can describe algorithms in a compact declarative way. It can directly embed many rule-based formalisms and systems.
The clean logical semantics of CHR ensures that several desirable properties hold for proper CHR programs for free (such as incrementality). It also facilitates non-trivial program analysis (such as confluence). In particular, operational equivalence of terminating programs is decidable.
Last but not least, we present typical academic and commercial applications from the international CHR community. They range from stock broking to a world record attempt in robot sailing.
- Conference URL: http://2015.ruleml.org
- Conference hashtag: #RuleML2015
- Organization Website: http://www.ruleml.org
- RuleML Blog & Social Mediazine: http://blog.ruleml.org