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

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

Publisher Summary This chapter reviews that constraint logic programming (CLP) is the
merger of two declarative paradigms: constraint solving and logic programming. As both …

Most previous theoretical study of the complexity of the constraint satisfaction problem has
considered a simplified version of the problem in which all variables have the same domain …

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

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

A widely adopted approach to solving constraint satisfaction problems combines systematic
tree search with various degrees of constraint propagation for pruning the search space …

Finite-domain constraint solvers based on Binary Decision Diagrams (BDDs) are a powerful
technique for solving constraint problems over finite set and integer variables represented …

Combining mutually redundant models with channelling constraints increases constraint
propagation. However, the extra computation efforts of the additional variables and …

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 …