Abstract
This paper describes the integration of Squolem, Quantified Boolean Formulas (QBF) solver, with the interactive theorem prover HOL Light. Squolem generates certificates of validity which are based on witness functions. The certificates are checked in HOL Light by constructing proofs based on these certificates. The presented approach allows HOL Light users to prove larger valid QBF problems than before and provides correctness checking of Squolem’s outputs based on the LCF approach. An error in Squolem was discovered thanks to the integration. Experiments show that the feasibility of the integration is very sensitive to implementation of HOL Light and used inferences. This resulted in improvements in HOL Light’s inference system.
This is a preview of subscription content, log in via an institution to check access.
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
Akbarpour, B., Paulson, L.C.: MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions. J. Autom. Reasoning 44(3), 175–205 (2010)
Benedetti, M., Mangassarian, H.: QBF-Based Formal Verification: Experience and Perspectives, vol. 5, pp. 133–191 (2008)
Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic Model Checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)
Böhme, S., Weber, T.: Fast LCF-Style Proof Reconstruction for Z3. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 179–194. Springer, Heidelberg (2010)
Kleine Büning, H., Zhao, X.: On Models for Quantified Boolean Formulas. In: Lenski, W. (ed.) Logic versus Approximation. LNCS, vol. 3075, pp. 18–32. Springer, Heidelberg (2004)
Dershowitz, N., Hanna, Z., Katz, J.: Bounded Model Checking with QBF. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 408–414. Springer, Heidelberg (2005)
Giunchiglia, E., Narizzano, M., Tacchella, A.: QBF Reasoning on Real-World Instances. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 105–121. Springer, Heidelberg (2005)
Gordon, M.: From LCF to HOL: a short history.. In: Plotkin, G.D., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction, pp. 169–186. MIT Press, Cambridge (2000)
Harrison, J.: Binary Decision Diagrams as a HOL Derived Rule. Comput. J. 38(2), 162–170 (1995)
Harrison, J.: Towards self-verification of HOL light. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 177–191. Springer, Heidelberg (2006)
Harrison, J.: The HOL Light theorem prover (2010), http://www.cl.cam.ac.uk/~jrh13/hol-light/
Harrison, J., Slind, K., Arthan, R.D.: HOL. In: Wiedijk, F. (ed.) The Seventeen Provers of the World. LNCS (LNAI), vol. 3600, pp. 11–19. Springer, Heidelberg (2006)
Harrison, J., Théry, L.: A skeptic’s approach to combining HOL and Maple. Journal of Automated Reasoning 21, 279–294 (1998)
HOL contributors: HOL4 Kananaskis 6 source code (2010), http://hol.sourceforge.net (retreived February 6, 2011)
Hurd, J.: An LCF-Style Interface between HOL and First-Order Logic. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 134–138. Springer, Heidelberg (2002)
Hurd, J.: First-Order Proof Tactics in Higher-Order Logic Theorem Provers. In: Archer, M., Vito, B.D., Muñoz, C. (eds.) Design and Application of Strategies/Tactics in Higher Order Logics (STRATA 2003), Design and Application of Strategies/Tactics in Higher Order Logics (STRATA 2003), pp. 56–68, No. NASA/CP-2003-212448 in NASA Technical Reports (September 2003)
Jussila, T., Biere, A., Sinz, C., Kröning, D., Wintersteiger, C.M.: A First Step Towards a Unified Proof Checker for QBF. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 201–214. Springer, Heidelberg (2007)
Kröning, D., Wintersteiger, C.: A file format for QBF certificates (2007), http://www.cprover.org/qbv/download/qbcformat.pdf (retreived February 6, 2011)
Meng, J., Paulson, L.C.: Translating Higher-Order Clauses to First-Order Clauses. J. Autom. Reasoning 40(1), 35–60 (2008)
Meyer, A., Stockmeyer, L.: Word Problems Requiring Exponential Time. In: Proc. 5th ACM Symp. on the Theory of Computing, pp. 1–9 (1973)
Narizzano, M., Peschiera, C., Pulina, L., Tacchella, A.: Evaluating and certifying QBFs: A comparison of state-of-the-art tools. AI Commun. 22(4), 191–210 (2009)
Otwell, C., Remshagen, A., Truemper, K.: An Effective QBF Solver for Planning Problems.. In: Arabnia, H.R., Joshua, R., Ajwa, I.A., Gravvanis, G.A. (eds.) MSV/AMCS, pp. 311–316. CSREA Press, Boca Raton (2004)
Paulson, L.C., Susanto, K.W.: Source-Level Proof Reconstruction for Interactive Theorem Proving. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 232–245. Springer, Heidelberg (2007)
Weber, T.: Validating QBF Invalidity in HOL4. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 466–480. Springer, Heidelberg (2010)
Weber, T., Amjad, H.: Efficiently checking propositional refutations in HOL theorem provers. Journal of Applied Logic 7(1), 26–40 (2009); special Issue: Empirically Successful Computerized Reasoning
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kunčar, O. (2011). Proving Valid Quantified Boolean Formulas in HOL Light. In: van Eekelen, M., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds) Interactive Theorem Proving. ITP 2011. Lecture Notes in Computer Science, vol 6898. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22863-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-22863-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22862-9
Online ISBN: 978-3-642-22863-6
eBook Packages: Computer ScienceComputer Science (R0)