“Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic,
applied areas such as planning, scheduling, operations research and combinatorial …

This book provides a comprehensive and much needed introduction to the field by one of its
foremost experts. It is beautifully written and presents a unifying framework capturing a wide …

Unpredictability in the running time of complete search procedures can often be explained
by the phenomenon of “heavy-tailed cost distributions”, meaning that at any time during the …

This account of propositional logic concentrates on the algorithmic translation of important
methods, especially of decision procedures for (subclasses of) propositional logic. Important …

Deductive algorithmic science has reached a high level of sophistication, but its worst-case
and average-case results seldom tell us how well an algorithm is actually going to work in …

Local search algorithms are among the standard methods for solving hard combinatorial
problems from various areas of artificial intelligence and operations research. For SAT …

The traveling salesman problem is one of the most famous combinatorial problems. We
identify a natural parameter for the two-dimensional Euclidean traveling salesman problem …

Stochastic local search (SLS) algorithms for the propositional satisfiability problem (SAT)
have been successfully applied to solve suitably encoded search problems from various …

A major difficulty in evaluating incomplete local search style algorithms for constraint
satisfaction problems is the need for a source of hard problem instances that are guaranteed …

Stochastic search algorithms are among the most sucessful approaches for solving hard
combinatorial problems. A large class of stochastic search approaches can be cast into the …