Before a combinatorial problem can be solved by current SAT methods, it must usually be
encoded in conjunctive normal form, which facilitates algorithm implementation and allows a …

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

We describe a general algebraic formulation for a wide range of combinatorial problems
including Satisfiability, Graph Colorability and Graph Isomorphism In this formulation each …

This book presents a nearly complete classification of various restricted classes of
computational problems called Boolean constraint satisfaction problems. Roughly, these are …

Finite domain propagation solvers effectively represent the possible values of variables by a
set of choices which can be naturally modelled as Boolean variables. In this paper we …

Consistency techniques have been studied extensively in the past as a way of tackling
constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms …

I describe and study the 'support encoding'of binary constraint satisfaction problems (CSP's)
into boolean satisfiability (SAT). This is based on work by Kasif in 1990, in which clauses …

Motivated by the performance improvements made to SAT solvers in recent years, a number
of different encodings of constraints into SAT have been proposed. Concrete examples are …

We describe two basic approaches to using neural networks for optimization. The more
popular approach is to formulate a combinatorial optimization task in terms of minimizing a …

In recent years, portfolio approaches to solving SAT problems and CSPs have become
increasingly common. There are also a number of different encodings for representing CSPs …