A parallel machine for multiset transformation and its programming style
Future Generation Computer Systems
Concurrent constraint programming
Concurrent constraint programming
Operational Equivalence of CHR Programs and Constraints
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Essentials of Constraint Programming
Automatic generation of CHR constraint solvers
Theory and Practice of Logic Programming
A concurrent constraint handling rules implementation in Haskell with software transactional memory
Proceedings of the 2007 workshop on Declarative aspects of multicore programming
Parallel execution of multi-set constraint rewrite rules
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
A Compositional Semantics for CHR with Propagation Rules
Constraint Handling Rules
Concurrent goal-based execution of constraint handling rules
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
Rule-based programming experiences renaissance due to its applications in areas such as Business Rules, Semantic Web, Computational Biology, Verification and Security. Executable rules are used in declarative programming languages, in program transformation and analysis, and for reasoning in artificial intelligence applications.Constraint Handling Rules (CHR) [6, 8, 11] is a concurrent committed-choice constraint logic programming language consisting of guarded rules that transform multi-sets of atomic formulas (constraints) into simpler ones until exhaustion. CHR was initially developed for solving constraints, but has matured into a general-purpose concurrent constraint language over the last decade, because it can embed many rule-based formalisms and describe algorithms in a declarative way. The clean semantics of CHR facilitates non-trivial program analysis and transformation