Publisher Summary Constraint programming is a powerful paradigm for solving
combinatorial search problems that draws on a wide range of techniques from artificial …

Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two
relatively independent threads of research cross-fertilizing occasionally. These two …

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

Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …

Publisher Summary This chapter discusses that constraint reasoning involves various types
of techniques to tackle the inherent intractability of the problem of satisfying a set of …

In this paper, we show that the models of random CSP instances proposed by Xu and Li [K.
Xu, W. Li, Exact phase transitions in random constraint satisfaction problems, Journal of …

In this paper, we describe Compact-Table (CT), a bitwise algorithm to enforce Generalized
Arc Consistency (GAC) on table constraints. Although this algorithm is the default propagator …

Table constraints play an important role within constraint programming. Recently, many
schemes or algorithms have been proposed to propagate table constraints and/or to …

A solution to a binary constraint satisfaction problem is a set of discrete values, one in each
of a given set of domains, subject to constraints that allow only prescribed pairs of values in …

A table constraint is explicitly represented as its set of solutions or non-solutions. This ad hoc
(or extensional) representation may require space exponential to the arity of the constraint …