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 …

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 …

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 …

Solvers for quantified Boolean formulas (QBF) have become powerful tools for tackling hard
computational problems from various application domains, even beyond the scope of SAT …

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 …

We present the latest major release version 6.0 of the quantified Boolean formula (QBF)
solver DepQBF, which is based on QCDCL. QCDCL is an extension of the conflict-driven …

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 …

We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in
non-prenex, non-CNF form. We make two contributions. First, we reformulate clause/cube …