Journal article

Automatic implication checking for CHR constraints

T Schrijvers, B Demoen, G Duck, P Stuckey, T Frühwirth

Electronic Notes in Theoretical Computer Science | Published : 2006


Constraint Handling Rules (CHRs) are a high-level rule-based programming language commonly used to define constraint solvers. We present a method for automatic implication checking between constraints of CHR solvers. Supporting implication is important for implementing extensible solvers and reification, and for building hierarchical CHR constraint solvers. Our method does not copy the entire constraint store, but performs the check in place using a trailing mechanism. The necessary code enhancements can be done by automatic program transformation based on the rules of the solver. We extend our method to work for hierarchically organized modular CHR solvers. We show the soundness of our meth..

View full abstract

Citation metrics