Resolution for quantified Boolean formulas
Information and Computation
From LCF to HOL: a short history
Proof, language, and interaction
The Definition of Standard ML
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Programming and Computing in HOL
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
An LCF-Style Interface between HOL and First-Order Logic
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Translating Higher-Order Clauses to First-Order Clauses
Journal of Automated Reasoning
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Combining Coq and Gappa for Certifying Floating-Point Programs
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Evaluating and certifying QBFs: A comparison of state-of-the-art tools
AI Communications
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Journal of Automated Reasoning
A first step towards a unified proof checker for QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Learning to integrate deduction and search in reasoning about quantified boolean formulas
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Bounded model checking with QBF
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Fast LCF-Style proof reconstruction for z3
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Validating QBF invalidity in HOL4
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
The Quantified Boolean Formulae (QBF) solver Squolem can generate certificates of validity, based on Skolem functions. We present independent checking of these certificates in the HOL4 theorem prover. This enables HOL4 users to benefit from Squolem's automation for valid QBF problems. Detailed performance data shows that LCF-style checking of validity certificates is often (but not always) feasible even for large QBF instances. Additionally, our work provides high correctness assurances for Squolem's claims of validity and uncovered a soundness bug in a previous version of its certificate validator QBV.