Abstract
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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ayari, A., Basin, D.: QUBOS: Deciding Quantified Boolean Logic using Propositional Satisfiability Solvers. In: Aagaard, M.D., O’Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, Springer, Heidelberg (2002)
Benedetti, M.: Quantifier Trees for QBFs. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 378–385. Springer, Heidelberg (2005)
Biere, A.: Resolve and Expand. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 59–70. Springer, Heidelberg (2005)
Bubeck, U., Kleine Büning, H., Zhao, X.: Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 386–392. Springer, Heidelberg (2005)
Coste-Marquis, S., Le Berre, D., Letombe, F.: A Branching Heuristics for Quantified Renamable Horn Formulas. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 393–399. Springer, Heidelberg (2005)
Dowling, W., Gallier, J.: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. of Logic Programming 1(3), 267–284 (1984)
Egly, U., Seidl, M., Tompits, H., Woltran, S., Zolda, M.: Comparing Different Prenexing Strategies for Quantified Boolean Formulas. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 214–228. Springer, Heidelberg (2004)
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)
Henkin, L.: Some remarks on infinitely long formulas. In: Infinitistic Methods (Warsaw, 1961), pp. 167–183 (1961)
Horn, A.: On sentences which are true of direct unions of algebras. Journal of Symbolic Logic 16(1), 14–21 (1951)
Kleine Büning, H., Lettmann, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press, Cambridge (1999)
Kleine Büning, H., Subramani, K., Zhao, X.: On Boolean Models for Quantified Boolean Horn Formulas. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 93–104. Springer, Heidelberg (2004)
Le Berre, D., Narizzano, M., Simon, L., Tacchella, A.: The second QBF solvers comparative evaluation. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 376–392. Springer, Heidelberg (2005)
Letz, R.: Advances in Decision Procedures for Quantified Boolean Formulas. In: Proc. IJCAR Workshop on Theory and Applications of Quantified Boolean Formulas (2001)
Mneimneh, M., Sakallah, K.A.: Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 411–425. Springer, Heidelberg (2004)
Peterson, G., Azhar, S., Reif, J.: Lower Bounds for Multiplayer Non-Cooperative Games of Incomplete Information. Computers and Mathematics with Applications 41(7-8), 957–992 (2001)
Rintanen, J.: Constructing Conditional Plans by a Theorem-Prover. Journal of Artificial Intelligence Research 10, 323–352 (1999)
Zhang, L., Malik, S.: Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 200. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bubeck, U., Büning, H.K. (2006). Dependency Quantified Horn Formulas: Models and Complexity. In: Biere, A., Gomes, C.P. (eds) Theory and Applications of Satisfiability Testing - SAT 2006. SAT 2006. Lecture Notes in Computer Science, vol 4121. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814948_21
Download citation
DOI: https://doi.org/10.1007/11814948_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37206-6
Online ISBN: 978-3-540-37207-3
eBook Packages: Computer ScienceComputer Science (R0)