Skip to main content
SpringerLink
Log in

QuBIS: An (In)complete Solver for Quantified Boolean Formulas

  • Conference paper
Book cover MICAI 2008: Advances in Artificial Intelligence (MICAI 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5317))

Included in the following conference series:

  • 2005 Accesses

Abstract

In this paper we introduce QuBIS an (in)complete solver for quantified Boolean formulas (QBFs). The particularity of QuBIS is that it is not inherently incomplete, but it has the ability to surrender upon realizing that its deduction mechanism is becoming ineffective. Whenever this happens, QuBIS outputs a partial result which can be fed to a complete QBF solver for further processing. As our experiments show, not only QuBIS is competitive as an incomplete solver, but providing the output of QuBIS as an input to complete solvers can boost their performances on several instances.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ansotegui, C., Gomes, C.P., Selman, B.: Achille’s heel of QBF. In: Proc. of AAAI, pp. 275–281 (2005)

    Google Scholar 

  2. Benedetti, M.: sKizzo: a Suite to Evaluate and Certify QBFs. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 369–376. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Biere, A.: Resolve and Expand. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 59–70. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Bubeck, U., Büning, H.K.: Bounded universal expansion for preprocessing QBF. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 244–257. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7(3), 201–215 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  6. Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. In: Seventeenth National Conference on Artificial Intelligence (AAAI 2000), pp. 417–422. The MIT Press, Cambridge (2000)

    Google Scholar 

  7. Van Gelder, A., Tsuji, Y.K.: Satisfiability testing with more reasoning and less guessing. Technical Report UCSC-CRL-95-34 (1995)

    Google Scholar 

  8. Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantified Boolean Formulas satisfiability library (QBFLIB) (2001), www.qbflib.org

  9. Giunchiglia, E., Narizzano, M., Tacchella, A.: Clause-Term Resolution and Learning in Quantified Boolean Logic Satisfiability. Artificial Intelligence Research 26, 371–416 (2006), http://www.jair.org/vol/vol26.html

    MathSciNet  MATH  Google Scholar 

  10. Rowley, A.G.D., Gent, I.P., Hoos, H.H., Smyth, K.: Using Stochastic Local Search to Solve Quantified Boolean Formulae. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 348–362. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Jussila, T., Biere, A.: Compressing BMC Encodings with QBF. In: Proc. 4th Intl. Workshop on Bounded Model Checking (BMC 2006) (2006)

    Google Scholar 

  12. Kleine-Büning, H., Karpinski, M., Flögel, A.: Resolution for Quantified Boolean Formulas. Information and Computation 117(1), 12–18 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Narizzano, M., Pulina, L., Taccchella, A.: QBF solvers competitive evaluation (QBFEVAL) (2006), http://www.qbflib.org/qbfeval

  14. Narizzano, M., Pulina, L., Tacchella, A.: QBF competition 2006 (qbfeval 2006), www.qbfeval.org/2006

  15. 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)

    Chapter  Google Scholar 

  16. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)

    MATH  Google Scholar 

  17. Rish, I., Dechter, R.: Resolution versus search: Two strategies for sat. Journal of Automated Reasoning 24(1/2), 225–275 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  18. Samulowitz, H., Davies, J., Bacchus, F.: Preprocessing QBF. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 514–529. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: 5th Annual ACM Symposium on the Theory of Computation, pp. 1–9 (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DIST, Università di Genova, Viale Causa, 13, 16145, Genova, Italy

    Luca Pulina & Armando Tacchella

Authors
  1. Luca Pulina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Armando Tacchella
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Computing Research, National Polytechnic Institute, 07738, Mexico City, México

    Alexander Gelbukh

  2. Ciencias Computacionales, Instituto Nacional de Astrofísica, Óptica y Electrónica (INAOE), Luis Enrique Erro #1 , Sta. María Tonantzintla, 72840, Puebla, México

    Eduardo F. Morales

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pulina, L., Tacchella, A. (2008). QuBIS: An (In)complete Solver for Quantified Boolean Formulas. In: Gelbukh, A., Morales, E.F. (eds) MICAI 2008: Advances in Artificial Intelligence. MICAI 2008. Lecture Notes in Computer Science(), vol 5317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88636-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88636-5_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88635-8

  • Online ISBN: 978-3-540-88636-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation