into Boolean Satisfiability problems (SAT). Some of them use a logical variable for each
element in each domain: among these very successful are the direct and the support
encodings. Other methods, such as the log-encoding, use a logarithmic number of logical
variables to encode domains. However, they lack the propagation power of the direct and
support encodings, so many SAT solvers perform poorly on log-encoded CSPs. In this …