Skip to main content
SpringerLink
Log in

sKizzo: A Suite to Evaluate and Certify QBFs

  • Conference paper
Automated Deduction – CADE-20 (CADE 2005)

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

Included in the following conference series:

Abstract

We present sKizzo, a system designed to evaluate and certify QBFs by means of propositional skolemization and symbolic reasoning.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Ayari, A., Basin, D.: Bounded Model Construction for Monadic Second-order Logics. In: Proc. of CAV 2000 (2000)

    Google Scholar 

  2. Benedetti, M.: sKizzo: a QBF Decision Procedure based on Propositional Skolemization and Symbolic Reasoning, Tech.Rep. 04-11-03, ITC-irst (2004)

    Google Scholar 

  3. Benedetti, M.: sKizzo’s web site (2004), http://sra.itc.it/people/benedetti/sKizzo

  4. Benedetti, M.: Evaluating qBFs via symbolic skolemization. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 285–300. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Benedetti, M.: Extracting Certificates from Quantified Boolean Formulas. In: Proc. of IJCAI 2005 (2005)

    Google Scholar 

  6. Benedetti, M.: Quantifier trees for qBFs. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 378–385. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  8. Giunchiglia, E., Narizzano, M., Tacchella, A.: QuBE: A system for deciding Quantified Boolean Formulas Satisfiability. In: Proc. of the International Joint Conference on Automated Reasoning, IJCAR 2001 (2001)

    Google Scholar 

  9. Le Berre, D., Narizzano, M., Simon, L., Tacchella, A.: Second QBF solvers evaluation, avaliable on-line (2004), at http://www.qbflib.org

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

    Google Scholar 

  11. Zhang, L., Malik, S.: Towards Symmetric Treatment of Conflicts And Satisfaction in Quantified Boolean Satisfiability Solver. In: Proc. of CP 2002 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Istituto per la Ricerca Scientifica e Tecnologica (IRST), Via Sommarive 18, 38055, Povo, Trento, Italy

    Marco Benedetti

Authors
  1. Marco Benedetti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technical University of Catalonia, Barcelona

    Robert Nieuwenhuis

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benedetti, M. (2005). sKizzo: A Suite to Evaluate and Certify QBFs. In: Nieuwenhuis, R. (eds) Automated Deduction – CADE-20. CADE 2005. Lecture Notes in Computer Science(), vol 3632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11532231_27

Download citation

  • DOI: https://doi.org/10.1007/11532231_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28005-7

  • Online ISBN: 978-3-540-31864-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation