Abstract Constraint Handling Rules (CHRs) are a high-level rule-based programming
language commonly used to write constraint solvers. The theoretical operational semantics …

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

Constraint Handling Rules (CHR) is a high-level rule-based programming language which
is increasingly used for general-purpose programming. We introduce the CHR machine, a …

Die Constraint-Programmierung liefert Methoden zur effizienten Modellierung von Systemen
oder zur Lösung von Problemstellungen, bei denen nur unvollständige Informationen …

A grammar formalism based upon CHR is proposed analogously to the way Definite Clause
Grammars are defined and implemented on top of Prolog. These grammars execute as …

Dataflow languages provide natural support for specifying constraints between objects in
dynamic applications, where programs need to react efficiently to changes of their …

The most recent and advanced implementation of constraint handling rules (CHR) is
introduced in a logic programming language. The Prolog implementation consists of a …

As extensions to traditional logic programming, both tabling and Constraint Logic
Programming (CLP) have proven powerful tools in many areas. They make logic …

In this paper, we propose a new language, called AR (Action Rules), and describe how
various propagators for finite-domain constraints can be implemented in it. An action rule …

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 …