Abstract
We present an extension of Q-Unit resolution for formulas that are not completely in clausal form. This b-unit resolution is applied to different classes of quantified Boolean formulas in which the existential and universal variables satisfy the Horn property. These formulas are transformed into propositional equivalents consisting of only polynomially many subformulas. We obtain compact encodings as Boolean circuits and show that both representations have the same expressive power.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anderaa, S., Börger, E.: The Equivalence of Horn and Network Complexity for Boolean Functions. Acta Informatica 15, 303–307 (1981)
Bauer, M., Brand, D., Fischer, M., Meyer, A., Paterson, M.: A Note on Disjunctive Form Tautologies. SIGACT News 5(2), 17–20 (1973)
Bubeck, U., Kleine Büning, H.: Models and Quantifier Elimination for Quantified Horn Formulas. Discrete Applied Mathematics 156(10), 1606–1622 (2008)
Flögel, A., Karpinski, M., Kleine Büning, H.: Subclasses of Quantified Boolean Formulas. In: Schönfeld, W., Börger, E., Kleine Büning, H., Richter, M.M. (eds.) CSL 1990. LNCS, vol. 533, pp. 145–155. Springer, Heidelberg (1991)
Flögel, A., Karpinski, M., Kleine Büning, H.: Resolution for Quantified Boolean Formulas. Information and Computation 117(1), 12–18 (1995)
Karpinski, M., Kleine Büning, H., Schmitt, P.: On the computational complexity of quantified Horn clauses. In: CSL 1987. LNCS, vol. 329, pp. 129–137. Springer, Heidelberg (1988)
Lonsing, F., Biere, A.: Nenofex: Expanding NNF for QBF Solving. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 196–210. Springer, Heidelberg (2008)
Sabharwal, A., Ansotegui, C., Gomes, C., Hart, J., Selman, B.: QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 382–395. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kleine Büning, H., Zhao, X., Bubeck, U. (2009). Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits. In: Kullmann, O. (eds) Theory and Applications of Satisfiability Testing - SAT 2009. SAT 2009. Lecture Notes in Computer Science, vol 5584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02777-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-02777-2_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02776-5
Online ISBN: 978-3-642-02777-2
eBook Packages: Computer ScienceComputer Science (R0)