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. While this representation does not cover the full language of QBF, ...
Given a formula in quantifier-free Presburger arithmetic, it is well known that, if there is a satisfying solution to , there is one whose size, measured in bits, is polynomially bounded in the size of . In this paper, we consider a special class of ...
Dependency quantified Boolean formulas (DQBFs) are a powerful formalism, which subsumes quantified Boolean formulas (QBFs) and allows an explicit specification of dependencies of existential variables on universal variables. Driven by ...
Ellis Horwood
United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in