Quantified Boolean formulas (QBF) are a generalization of propositional formulas by
allowing universal and existential quantifiers over variables. This enhancement makes QBF …

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 …

Many search-based QBF solvers implementing the DPLL algorithm for QBF (QDPLL)
process formulae in prenex conjunctive normal form (PCNF). The quantifier prefix of PCNFs …

The implementation of effective reasoning tools for deciding the satisfiability of Quantified
Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence and …

Modern solvers for quantified Boolean formulas (QBFs) process formulas in prenex form,
which divides each QBF into two parts: the quantifier prefix and the propositional matrix …

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 …

The topic of this paper is Nenofex, a solver for quantified boolean formulae (QBF) in
negation normal form (NNF), which relies on expansion as the core technique for eliminating …

This paper describes a generic approach to implement propositional argumentation
frameworks by means of quantified Boolean formulas (QBFs). The motivation to this work is …

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 …

Equilibrium logic is an approach to non-monotonic reasoning that extends the stable-model
and answer-set semantics for logic programs. In particular, it includes the general case of …