Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

The use of constraints had its scientific and commercial breakthrough in the 1990s.
Programming with constraints makes it possible to model and specify problems with …

We are investigating the use of a class of logical formulas to define constraint theories and
implement constraint solvers at the same time. The representation of constraint evaluation in …

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 …

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

Abstract Constraint Handling Rules (CHR) is both an effective concurrent declarative
constraint-based programming language and a versatile computational formalism. While …

While it is generally agreed-upon that certain classes of CHR states should be considered
equivalent, no standard definition of equivalence has ever been established. Furthermore …

One of the attractive features of the Constraint Handling Rules (CHR) programming
language is its declarative semantics where rules are read as formulae in first-order …

Abstract Constraint Handling Rules is a logical concurrent committed-choice rule-based
language. Recently it was shown that the classical union-find algorithm can be implemented …