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 …

We introduce a unified logical theory, based on signed theories and Quantified Boolean
Formulas (QBFs) that can serve as the basis for representing and computing various …

P systems with active membranes are powerful parallel natural computing models, which
were inspired by cell structure and behavior. Inspired by the parallel processing of biological …

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 …

We suggest a general framework to study dependency schemes for dependency quantified
Boolean formulas (DQBF). As our main contribution, we exhibit a new infinite collection of …

We provide a tight characterisation of proof size in resolution for quantified Boolean formulas
(QBF) via circuit complexity. Such a characterisation was previously obtained for a hierarchy …

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

Fault trees (FTs) are hierarchical diagrams used to model the propagation of faults in a
system. Fault tree analysis (FTA) is a widespread technique that allows to identify the key …

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 …

As the complexity of digital designs continuously increases, existing methods to ensure their
correctness are facing more serious challenges. Although many studies have been provided …