Publisher Summary The past few years have seen enormous progress in the performance of
Boolean satisfiability (SAT) solvers. Despite the worst-case exponential run time of all known …

The past five years have seen dramatic advances in planning algorithms, with an emphasis
on propositional methods such as GRAPHPLAN and compilers that convert planning …

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

Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …

Boolean Satisfiability is probably the most studied of combinatorial optimization/search
problems. Significant effort has been devoted to trying to provide practical solutions to this …

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 …

Metaheuristics are a relatively new but already established approach to combinatorial
optimization. A metaheuristic is a generic algorithmic template that can be used for finding …

SATLIB is an online resource for SAT-related research established in June 1998. Its core
components, a benchmark suite of SAT instances and a collection of SAT solvers, aim to …

Research in exact algorithms, heuristics and metaheuristics for solving combinatorial
optimization problems is nowadays highly on the rise. The main advantage of using exact …