Extended Resolution Proofs for Symbolic SAT Solving with Quantification
From MaRDI portal
Recommendations
Cited in
(15)- Generating extended resolution proofs with a BDD-based SAT solver
- Dual proof generation for quantified Boolean formulas with a BDD-based solver
- Simulating strong practical proof systems with extended resolution
- Solution validation and extraction for QBF preprocessing
- Extracting unsatisfiable cores for LTL via temporal resolution
- Functional encryption for inner product with full function privacy
- NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability
- Extended Resolution Proofs for Conjoining BDDs
- Enhancing unsatisfiable cores for LTL with information on temporal relevance
- Compressing propositional refutations
- Generating Extended Resolution Proofs with a BDD-Based SAT Solver
- Extended clause learning
- Clausal proofs for pseudo-Boolean reasoning
- Making \(\mathsf{IP}=\mathsf{PSPACE}\) practical: efficient interactive protocols for BDD algorithms
- Symbolic techniques in satisfiability solving
This page was built for publication: Extended Resolution Proofs for Symbolic SAT Solving with Quantification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756562)