Dependency Quantified Horn Formulas: Models and Complexity
Dependency quantified Boolean formulas (DQBF) extend quantified Boolean formulas with Henkin-style partially ordered quantifiers. It has been shown that this is likely to yield more succinct representations at the price of a computational blow-up from PSPACE to NEXPTIME. In this paper, we consider dependency quantified Horn formulas (DQHORN), a subclass of DQBF, and show that the computational simplicity of quantified Horn formulas is preserved when adding partially ordered quantifiers.
We investigate the structure of satisfiability models for DQHORN formulas and prove that for both DQHORN and ordinary QHORN formulas, the behavior of the existential quantifiers depends only on the cases where at most one of the universally quantified variables is zero. This allows us to transform DQHORN formulas with free variables into equivalent QHORN formulas with only a quadratic increase in length.
An application of these findings is to determine the satisfiability of a dependency quantified Horn formula Φ with |∀| universal quantifiers in time O(| ∀ |·|Φ|), which is just as hard as QHORN-SAT.
KeywordsFree Variable Conjunctive Normal Form Truth Assignment Boolean Formula Propositional Formula
Unable to display preview. Download preview PDF.
- 8.Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantifier structure in search based procedures for QBFs. In: Proc. Design, Automation and Test in Europe (DATE 2006) (2006)Google Scholar
- 9.Henkin, L.: Some remarks on infinitely long formulas. In: Infinitistic Methods (Warsaw, 1961), pp. 167–183 (1961)Google Scholar
- 14.Letz, R.: Advances in Decision Procedures for Quantified Boolean Formulas. In: Proc. IJCAR Workshop on Theory and Applications of Quantified Boolean Formulas (2001)Google Scholar