We present Minion, a new constraint solver. Empirical results on standard benchmarks show
orders of magnitude performance gains over state-of-the-art constraint toolkits. These gains …

This article presents a model and implementation techniques for speeding up constraint
propagation. Three fundamental approaches to improving constraint propagation based on …

The AllDifferent constraint is a crucial component of any constraint toolkit, language or
solver, since it is very widely used in a variety of constraint models. The literature contains …

Extensional (table) constraints are an important tool for attacking combinatorial problems
with constraint programming. Recently there has been renewed interest in fast propagation …

Modern statistical AI systems are quite large and complex; this interferes with research,
development, and education. We point out that most of the computation involves database …

Table Constraints are very useful for modeling combinatorial problems in Constraint
Programming (CP). They are a universal mechanism for representing constraints, but …

Constraint solvers are complex pieces of software and are notoriously difficult to debug. In
large part this is due to the difficulty of pinpointing the source of an error in the vast searches …

Constraint propagation is one of the key techniques in constraint programming, and a large
body of work has built up around it. Special-purpose constraint propagation algorithms …

I prove that an implementation technique for scanning lists in backtracking search algorithms
is optimal. The result applies to a simple general framework, which I present: applications …

The number of finite semigroups increases rapidly with the number of elements. Since
existing counting formulae do not give the complete number of semigroups of given order up …