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 …

Preprocessing SAT instances can reduce their size considerably. We combine variable
elimination with subsumption and self-subsuming resolution, and show that these …

Within the verification community, there has been a recent increase in interest in Quantified
Boolean Formula evaluation (QBF) as many interesting sequential circuit verification …

Algorithms based on the enumeration of implicit hitting sets find a growing number of
applications, which include maximum satisfiability and model based diagnosis, among …

The increasing role of quantified Boolean logic in many applications calls for practically
efficient decision procedures. One of the most promising paradigms is the semantic tree …

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 …

In this paper, we describe a new framework for evaluating Quantified Boolean Formulas
(QBF). The new framework is based on the Davis-Putnam (DPLL) search algorithm. In …

Deciding the satisfiability of a Quantified Boolean Formula (QBF) is an important research
issue in Artificial Intelligence. Many reasoning tasks involving planning [1], abduction …

Abstract We describe Qubos (QUantified BOolean Solver), a decision procedure for
quantified Boolean logic. The procedure is based on non-clausal simplification techniques …

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 …