Proving Valid Quantified Boolean Formulas in HOL Light

  • Ondřej Kunčar
Conference paper

DOI: 10.1007/978-3-642-22863-6_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6898)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ondřej Kunčar
    • 1
  1. 1.Faculty of Mathematics and Physics Automated Reasoning GroupCharles University in PragueCzech Republic

Personalised recommendations