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 …

Constraint programming is an alternative approach to programming in which the
programming process is limited to a generation of requirements (constraints) and a solution …

We study here a natural situation when constraint programming can be entirely reduced to
rule-based programming. To this end we explain first how one can compute on constraint …

There are a number of extended forms of algebraic data types such as type classes with
existential types and generalized algebraic data types. Such extensions are highly useful …

A general approach to implement propagation and simplification of constraints consists of
applying rules over these constraints. However, a difficulty that arises frequently when …

The pioneering works of Apt and Monfroy, and Abdennadher and Rigotti have shown that
the construction of rule-based solvers can be automated using machine learning …

In this paper, we propose a new language-independent representation of adhoc constraints,
called a box constraint collection. Using constructive disjunction, this representation …

In this paper, we present a framework for automatic generation of CHR solvers given the
logical specification of the constraints. This approach takes advantage of the power of tabled …

A general approach to implement propagation and simplification of constraints consists of
applying rules over these constraints. However, a difficulty that arises frequently when …

This paper proposes a new set of propagation rules for quantified Boolean formulae based
on literals and generated automatically thanks to quantified Boolean formulae certificates …