Dramatic improvements in SAT solver technology over the last decade and the growing
need for more efficient and scalable verification solutions have fueled research in …

We present a novel expansion based decision procedure for quantified boolean formulas
(QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantified …

Resolution is the rule of inference at the basis of most procedures for automated reasoning.
In these procedures, the input formula is first translated into an equisatisfiable formula in …

Learning, ie, the ability to record and exploit some information which is unveiled during the
search, proved to be a very effective AI technique for problem solving and, in particular, for …

Current algorithms for bounded model checking (BMC) use SAT methods for checking
satisfiability of Boolean formulas. These BMC methods suffer from a potential memory …

The SAT 2003 Competition ran in February–May 2003, in conjunction with SAT'03 (the Sixth
Fifth International Symposium on the Theory and Applications of Satisfiability Testing). One …

We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which
aims to unleash the hidden potential of quantified reasoning in applications. The Skolem …

Much recent work has gone into adapting techniques that were originally developed for SAT
solving to QBF solving. In particular, QBF solvers are often based on SAT solvers. Most …

We present an experimental study of the effects of quantifier alternations on the evaluation of
quantified Boolean formula (QBF) solvers. The number of quantifier alternations in a QBF in …

For the third consecutive year, a SAT competition was organized as a joint event with the
SAT conference. With 55 solvers from 25 author groups, the competition was a clear …