Constraint Handling Rules (CHR) is a high-level programming language based on
multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint …

We construct a readable, compact and efficient implementation of Dijkstra's shortest path
algorithm and Fibonacci heaps using Constraint Handling Rules (CHR), which is …

In this paper, we address the different conceptual and technical difficulties encountered
when embedding CHR into an imperative host language. We argue that a tight, natural …

We introduce a systematic, concurrent execution scheme for Constraint Handling Rules
(CHR) based on a previously proposed sequential goal-based CHR semantics. We …

Abstract Constraint Handling Rules [1, 2] is a high-level programming language extension
based on multi-headed committed-choice multiset rewrite rules. It can be used as a stand …

Program transformation is an appealing technique which allows to improve run-time
efficiency, space-consumption and more generally to optimize a given program. Essentially …

Program transformation is an appealing technique which allows to improve run-time
efficiency, space-consumption, and more generally to optimize a given program. Essentially …

Multi-headed rules are essential for the expressiveness of Constraint Handling Rules
(CHR), but incur considerable performance overhead. Current indexing techniques are often …

Multi-headed rules are essential for the expressiveness of CHR, but incur a considerable
performance penalty. Current indexing techniques are often unable to address this problem …

Developing constraint solvers which are key requisites of constraint programming
languages is time consuming and difficult. In this paper, we propose a generic algorithm that …