Advertisement

Abstract

In this paper we present a new technique to solve Quantified Boolean Formulas (QBF). Our technique applies the idea of dynamic partitioning to QBF solvers. Dynamic partitioning has previously been utilized in #SAT solvers that count the number of models of a propositional formula. One of the main differences with the #SAT case comes from the solution learning techniques employed in search based QBF solvers. Extending solution learning to a partitioning solver involves some considerable complexities which we show how to resolve. We have implemented our ideas in a new QBF solver, and demonstrate that dynamic partitioning is able to increase the performance of search based solvers, sometimes significantly. Empirically our new solver offers performance that is superior to other search based solvers and in many cases superior to non-search based solvers.

Keywords

Variable Versus Current Path Boolean Formula Propositional Formula Average Success Rate 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bryant, R., Lahiri, S., Seshia, S.: Convergence testing in term-level bounded model checking. Technical Report CMU-CS-03-156, Carnegie Mellon University (2003)Google Scholar
  2. 2.
    Egly, U., et al.: Solving advanced reasoning tasks using quantified boolean formulas. In: AAAI/IAAI, pp. 417–422 (2000)Google Scholar
  3. 3.
    Rintanen, J.: Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research 10, 323–352 (1999)zbMATHGoogle Scholar
  4. 4.
    Ali, M., et al.: Post-verification debugging of hierarchical designs. In: International Conf. on Computer Aided Design (ICCAD), pp. 871–876 (2005)Google Scholar
  5. 5.
    Bayardo Jr., R.J., Pehoushek, J.D.: Counting models using connected components. In: Proceedings of the AAAI National Conference (AAAI), pp. 157–162 (2000)Google Scholar
  6. 6.
    Darwiche, A.: On the tractable counting of theory models and its application to truth maintenance and belief revision. Journal of Applied Non-Classical Logics 11(1-2), 11–34 (2001)CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    Bacchus, F., Dalmao, S., Pitassi, T.: Algorithms and Complexity Results for #SAT and Bayesian Inference. In: 44th Symposium on Foundations of Computer Science (FOCS), pp. 340–351 (2003)Google Scholar
  8. 8.
    Samulowitz, H., Bacchus, F.: QBF Solver 2clsQ (2006), available at http://www.cs.toronto.edu/~fbacchus/sat.html
  9. 9.
    Biere, A.: Resolve and Expand. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 59–70. Springer, Heidelberg (2005)Google Scholar
  10. 10.
    Benedetti, M.: sKizzo: a QBF decision procedure based on propositional skolemization and symbolic reasoning. Technical Report TR04-11-03 (2004)Google Scholar
  11. 11.
    Bacchus, F., Samulowitz, H., Davies, J.: Preprocessing QBF. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 514–529. Springer, Heidelberg (2006)Google Scholar
  12. 12.
    Büning, H.K., Karpinski, M., Flügel, A.: Resolution for quantified boolean formulas. Inf. Comput. 117(1), 12–18 (1995)CrossRefzbMATHGoogle Scholar
  13. 13.
    Zhang, L., Malik, S.: Towards symmetric treatment of conflicts and satisfaction in quantified boolean satisfiability solver. In: Principles and Practice of Constraint Programming (CP2002), pp. 185–199 (2002)Google Scholar
  14. 14.
    Giunchiglia, E., Narizzano, M., Tacchella, A.: Learning for quantified boolean logic satisfiability. In: Eighteenth national conference on Artificial intelligence, pp. 649–654 (2002)Google Scholar
  15. 15.
    Benedetti, M.: Quantifier Trees for QBFs. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 378–385. Springer, Heidelberg (2005)Google Scholar
  16. 16.
    Sang, T., et al.: Combining component caching and clause learning for effective model counting. In: SAT (2004)Google Scholar
  17. 17.
    Bacchus, F., Samulowitz, H.: Binary Clause Reasoning in QBF. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 353–367. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  18. 18.
    Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantified Boolean Formulas satisfiability library (QBFLIB) (2001), http://www.qbflib.org
  19. 19.
    Giunchiglia, E., Tacchella, A., Narizzano, M.: QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, Springer, Heidelberg (2001)Google Scholar
  20. 20.
    Bacchus, F., Samulowitz, H.: Using SAT in QBF. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 578–592. Springer, Heidelberg (2005)Google Scholar
  21. 21.
    Giunchiglia, E., Narizzano, M., Tacchella, A.: The qbf2006 competition (2006) (2006), available on line at http://www.qbflib.org/
  22. 22.
    Samulowitz, H., Davies, J., Bacchus, F.: QBF Preprocessor Prequel (2006), available at http://www.cs.toronto.edu/~fbacchus/sat.html

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Horst Samulowitz
    • 1
  • Fahiem Bacchus
    • 1
  1. 1.Department of Computer Science, University of TorontoCanada

Personalised recommendations