A First Step Towards a Unified Proof Checker for QBF
From MaRDI portal
Publication:3612467
Recommendations
Cited in
(20)- scientific article; zbMATH DE number 5542982 (Why is no real title available?)
- A Compact Representation for Syntactic Dependencies in QBFs
- Hardness and optimality in QBF proof systems modulo NP
- Towards Uniform Certification in QBF
- Validating QBF Validity in HOL4
- Functional encryption for inner product with full function privacy
- Failed literal detection for QBF
- Formal correctness of a quadratic unification algorithm
- Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification
- Unified QBF certification and its applications
- The Qu-Prolog unification algorithm: formalisation and correctness
- Ranking function synthesis for bit-vector relations
- Dual proof generation for quantified Boolean formulas with a BDD-based solver
- On Unification of QBF Resolution-Based Calculi
- Solution validation and extraction for QBF preprocessing
- A Unified Framework for Certificate and Compilation for QBF
- On QBF Proofs and Preprocessing
- CAQE and QuAbS: Abstraction Based QBF Solvers
- First-order unification in the PVS proof assistant
- Proving Valid Quantified Boolean Formulas in HOL Light
This page was built for publication: A First Step Towards a Unified Proof Checker for QBF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612467)