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 …

LNAI 3632 - sKizzo: A Suite to Evaluate and Certify QBFs Page 1 sKizzo: A Suite to Evaluate
and Certify QBFs Marco Benedetti Istituto per la Ricerca Scientifica e Tecnologica (IRST), Via …

Abstract The language of Quantified Boolean Formulas (QBF) has a lot of potential
applications to Formal Verification (FV) tasks, as it captures many of these tasks in a natural …

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 …

In the last years synthesis of reversible logic functions has emerged as an important
research area. Other fields such as low-power design, optical computing and quantum …

It is known that no algorithm can extract the minimal depleting Σ-module from ontologies in
expressive description logics (DLs). Thus research has focused on algorithms that …

We present the tool qbf2epr which translates quantified Boolean formulas (QBF) to formulas
in effectively propositional logic (EPR). The decision problem of QBF is the prototypical …

In this paper we investigate the use of preprocessing when solving Quantified Boolean
Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and …

QBF is the problem of deciding the satisfiability of quantified boolean formulae in which
variables can be either universally or existentially quantified. QBF generalizes SAT (SAT is …

A certificate of satisfiability for a quantified boolean formula is a compact representation of
one of its models which is used to provide solverindependent evidence of satisfiability. In …