Abstract
We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications. The Skolem theorem acts like a glue holding several ingredients together: BDD-based representations for boolean functions, search-based QBF decision procedure, and compilation-to-SAT techniques, among the others. To leverage all these techniques at once we show how to evaluate QBFs by symbolically reasoning on a compact representation for the propositional expansion of the skolemized problem. We also report about a first implementation of the procedure, which yields very interesting experimental results.
This work was supported by PAT (Provincia Autonoma di Trento, Italy), grant n. 3248/2003.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ayari, A., Basin, D.: Bounded Model Construction for Monadic Second-order Logics. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, Springer, Heidelberg (2000)
Bacchus, F., Winter, J.: Effective Preprocessing with Hyper-Resolution and Equality Reduction. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 341–355. Springer, Heidelberg (2004)
Benedetti, M.: sKizzo: a QBF Decision Procedure based on Propositional Skolemization and Symbolic Reasoning, Tech.Rep. 04-11-03, ITC-irst (2004), available at http://sra.itc.it/people/benedetti/sKizzo
Biere, A.: Resolve and Expand. In: Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 238–246. Springer, Heidelberg (2005)
Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transaction on Computing C-35(8), 677–691 (1986)
Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified boolean formulae. In: Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence. American Association for Artificial Intelligence, pp. 262–267 (1998)
Chatalic, P., Simon, L.: Multi-Resolution on compressed sets of clauses. In: Proceedings of the Twelfth International Conference on Tools with Artificial Intelligence, ICTAI 2000 (2000)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Journal of the ACM 5, 394–397 (1962)
Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7 (1960)
Feldmann, R., Monien, B., Schamberger, S.: A Distributed Algorithm to Evaluate Quantified Boolean Formulas. In: Proceedings of the AAAI National Conference on Artificial Intelligence, pp. 285–290 (2000)
Fitting, M.: First-Order Logic and Automated Theorem Proving. Springer, Heidelberg (1996)
Franco, J., Kouril, M., Schlipf, J., Ward, J., Weaver, S., Dransfield, M., Vanfleet, W.: SBSAT: a state-based, BDD-based satisfiability solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 398–410. Springer, Heidelberg (2004)
GhasemZadeh, M., Klotz, V., Meinel, C.: ZQSAT: A QSAT Solver based on Zerosuppressed Binary Decision Diagrams (2004), available at http://www.informatik.unitrier.de/TI/bdd-research/zqsat/zqsat.html
Giunchiglia, E., Narizzano, M., Tacchella, A.: QuBE: A system for deciding Quantified Boolean Formulas Satisfiability. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, p. 364. Springer, Heidelberg (2001)
Jackson, D.: Automating first-order relational logic. In: Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering, pp. 130–139. ACM Press, New York (2000)
Kautz, H., Selman, B.: Planning as satisfiability. In: Proc. of ECAI 1992, pp. 359–363 (1992)
Kleine-Buning, H., Karpinski, M., Flogel, A.: Resolution for quantified Boolean formulas. Information and Computation 117(1), 12–18 (1995)
Larrabee, T.: Test pattern generation using boolean satisfiability. In: IEEE Transaction on Computer-aided Design, pp. 4–15 (1992)
Le Berre, D., Narizzano, M., Simon, L., Tacchella, A.: Second QBF solvers evaluation (2004), avaliable on-line at http://www.qbflib.org
Le Berre, D., Simon, L., Tacchella, A.: Challenges in the QBF arena: the SAT’03 evaluation of QBF solvers. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 468–485. Springer, Heidelberg (2004), www.qbflib.org
Letz, R.: Advances in Decision Procedures for Quantified Boolean Formulas. In: Proceedings of the First International Workshop on Quantified Boolean Formulae (QBF 2001), pp. 55–64 (2001)
Letz, R.: Lemma and model caching in decision procedures for quantified boolean formulas. In: Proc. of the Int. Conf. on Automated Reasoning with Analytic Tableaux and Related Methods, pp. 160–175. Springer, Heidelberg (2002)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of the 38th Design Automation Conference (2001)
Motter, D.B., Markov, I.L.: A compressed, breadth-first search for satisfiability. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol. 2409, pp. 29–42. Springer, Heidelberg (2002)
Nonnengart, A., Weidenbach, C.: Computing Small Clause Normal Forms. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 6, pp. 335–367. Elsevier, Amsterdam (2001)
Pan, G., Y. Vardi, M.: Search vs. Symbolic Techniques in Satisfiability Solving. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 235–250. Springer, Heidelberg (2005)
Pan, G., Vardi, M.Y.: Symbolic Decision Procedures for QBF. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 453–467. Springer, Heidelberg (2004)
Rintanen, J.: Construction Conditional Plans by a Theorem-prover. Journal of A. I. Research, 323–352 (1999)
Rintanen, J.: Partial implicit unfolding in the davis-putnam procedure for quantified boolean formulae. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, p. 362. Springer, Heidelberg (2001)
Skolem, T.: Logico-combinatorial investigations in the satisfiability or provability of mathematical propositions: a simplified proof of a theorem by L. Löwenheim and generalizations of the theorem. In: From Frege to Gödel. A Source Book in Mathematical Logic, 1879-1931, pp. 252–263. Harvard University Press, Cambridge, 1967 (1920)
Somenzi, F.: Colorado University Binary Decision Diagrams (1995), http://vlsi.colorado.edu/fabio/CUDD
Uribe, T.E., Stickel, M.E.: Ordered binary decision diagrams and the Davis-Putnam procedure. In: Jouannaud, J.-P. (ed.) CCL 1994. LNCS, vol. 845, pp. 34–49. Springer, Heidelberg (1994)
Zhang, L., Malik, S.: Towards Symmetric Treatment of Conflicts And Satisfaction in Quantified Boolean Satisfiability Solver. 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
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benedetti, M. (2005). Evaluating QBFs via Symbolic Skolemization. In: Baader, F., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2005. Lecture Notes in Computer Science(), vol 3452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32275-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-32275-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25236-8
Online ISBN: 978-3-540-32275-7
eBook Packages: Computer ScienceComputer Science (R0)