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 …

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 …

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 …

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

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 …

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

Abstract We present DepQBF 0.1, a new search-based solver for quantified boolean
formulae (QBF). It integrates compact dependency graphs to overcome the restrictions …

Quantified Boolean formulae (QBF) allow compact encoding of many decision problems.
Their importance motivated the development of fast QBF solvers. Certifying the results of a …

We develop a formal framework for comparing different versions of ontologies, and apply it
to ontologies formulated in terms of DL-Lite, a family of 'lightweight'description logics …

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 …