Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas
In this paper, quantified Horn formulas with free variables (QHORN *) are investigated. The main result is that any quantified Horn formula Φ of length |Φ| with free variables, |∀| universal quantifiers and an arbitrary number of existential quantifiers can be transformed into an equivalent formula of length O(| ∀ | ·|Φ|) which contains only existential quantifiers. Moreover, it is shown that quantified Horn formulas with free variables have equivalence models where every existential quantifier is associated with a monotone Boolean function.
The results allow a simple representation of quantified Horn formulas as purely existentially quantified Horn formulas (∃ HORN *). An application described in the paper is to solve QHORN *-SAT in O(| ∀ | ·|Φ|) by using this transformation in combination with a linear-time satisfiability checker for propositional Horn formulas.
Unable to display preview. Download preview PDF.
- 3.Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified boolean formulae. In: Proc. 16th Natl. Conf. on AI, AAAI 1998 (1998)Google Scholar
- 9.Letz, R.: Advances in Decision Procedures for Quantified Boolean Formulas. In: Proc. IJCAR 2001 Workshop on Theory and Applications of QBF (2001)Google Scholar