This article puts forward the application of Counterexample Guided Abstraction Refinement
(CEGAR) in solving the well-known PSPACE-complete problem of quantified Boolean …

Quantified Boolean formulas (QBF) provide a powerful framework for encoding problems
from various application domains, not least because efficient QBF solvers are available …

This article introduces and studies a proof system∀ Exp+ Res that enables us to refute
quantified Boolean formulas (QBFs). The system∀ Exp+ Res operates in two stages: it …

There are well known cases of Quantified Boolean Formulas (QBFs) that have short winning
strategies (Skolem/Herbrand functions) but that are hard to solve by nowadays solvers. This …

We present our new preprocessor HQSpre, a state-of-the-art tool for simplifying quantified
Boolean formulas (QBFs) and the first available preprocessor for dependency quantified …

Over the last few years, much progress has been made in the theory and practice of solving
quantified Boolean formulas (QBF). Novel solvers have been presented that either …

Over the years, proof systems for propositional satisfiability (SAT) have been extensively
studied. Recently, proof systems for quantified Boolean formulas (QBFs) have also been …

Twelve years have elapsed since the first Quantified Boolean Formulas (QBFs) evaluation
was held as an event linked to SAT conferences. During this period, researchers have …

We develop a generic technique to compute minimal separating DFAs (deterministic finite
automata) and regular invariants. Our technique works by expressing the desired properties …

This paper introduces two techniques for translating bounded propositional reachability
problems into Quantified Boolean Formulae (QBF). Both exploit the binary-tree structure of …