One of the oldest and most popular approaches to automated planning is to encode the
problem at hand into a propositional formula and use a Satisfiability (SAT) solver to find a …

The decision problem of quantified Boolean formulas (QBFs) is the archetypical problem for
the complexity class PSPACE. Beside such theoretical aspects QBF also provides an …

As a natural extension of the SAT problem, an array of proof systems for quantified Boolean
formulas (QBF) have been proposed, many of which extend a propositional proof system to …

Most classical planners use grounding as a preprocessing step, essentially reducing
planning to propositional logic. However, grounding involves instantiating all rules and …

Resolution proof systems for quantified Boolean formulas (QBFs) provide a formal model for
studying the limitations of state-of-the-art search-based QBF solvers that use these systems …

Strategy extraction is of great importance for quantified Boolean formulas (QBF), both in
solving and proof complexity. So far in the QBF literature, strategy extraction has 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 …

Organic Synthesis is a computationally challenging practical problem concerned with
constructing a target molecule from a set of initially available molecules via chemical …

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

We consider the problem of incrementally solving a sequence of quantified Boolean
formulae (QBF). Incremental solving aims at using information learned from one formula in …