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

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 …

A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …

Reconfigurable Computing marks a revolutionary and hot topic that bridges the gap
between the separate worlds of hardware and software design—the key feature of …

Much research in the area of constraint processing has recently been focused on extracting
small unsatisfiable “cores” from unsatisfiable constraint systems with the goal of finding …

Beside the important progresses observed in SAT solving, a number of applications
explicitly rely on incremental SAT solving only. In this paper, we focus on refining the …

Certifying a SAT solver for unsatisfiable instances is a computationally hard problem.
Nevertheless, in the utilization of SAT in industrial settings, one often needs to be able to …

Applications in artificial intelligence, formal verification, and other areas have greatly
benefited from the recent advances in SAT. It is often the case, however, that applications in …

A variety of tasks in formal verification require finding small or minimal unsatisfiable cores
(subsets) of an unsatisfiable set of constraints. This paper proposes two algorithms for …

Much attention has been given in recent years to the problem of finding Minimally
Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new …