Pages that link to "Item:Q3612467"
From MaRDI portal
The following pages link to A First Step Towards a Unified Proof Checker for QBF (Q3612467):
Displaying 19 items.
- Formal correctness of a quadratic unification algorithm (Q877825) (← links)
- The Qu-Prolog unification algorithm: formalisation and correctness (Q1349886) (← links)
- Dual proof generation for quantified Boolean formulas with a BDD-based solver (Q2055876) (← links)
- Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
- Ranking function synthesis for bit-vector relations (Q2248069) (← links)
- Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
- Unified QBF certification and its applications (Q2441712) (← links)
- Functional Encryption for Inner Product with Full Function Privacy (Q2798775) (← links)
- On QBF Proofs and Preprocessing (Q2870148) (← links)
- On Unification of QBF Resolution-Based Calculi (Q2922598) (← links)
- Failed Literal Detection for QBF (Q3007688) (← links)
- Validating QBF Validity in HOL4 (Q3088005) (← links)
- Proving Valid Quantified Boolean Formulas in HOL Light (Q3088006) (← links)
- A Unified Framework for Certificate and Compilation for QBF (Q3601811) (← links)
- (Q3620436) (← links)
- A Compact Representation for Syntactic Dependencies in QBFs (Q3637175) (← links)
- First-order unification in the PVS proof assistant (Q4644611) (← links)
- CAQE and QuAbS: Abstraction Based QBF Solvers (Q5015608) (← links)
- Towards Uniform Certification in QBF (Q6151563) (← links)