Towards Uniform Certification in QBF
From MaRDI portal
Publication:6151563
Cites work
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- A First Step Towards a Unified Proof Checker for QBF
- A little blocked literal goes a long way
- Automated testing and debugging of SAT and QBF solvers
- Building strategies into QBF proofs
- Computational Complexity
- Contributions to the theory of practical quantified Boolean formula solving
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Dependency Learning for QBF
- Efficient certified RAT verification
- Expansion-based QBF solving versus Q-resolution
- Frege systems for quantified Boolean logic
- Hardness and optimality in QBF proof systems modulo NP
- Integrating dependency schemes in search-based QBF solvers
- Local soundness for QBF calculi
- Long-distance Q-resolution with dependency schemes
- Long-distance resolution: proof generation and strategy extraction in search-based QBF solving
- Multi-linear strategy extraction for QBF expansion proofs via local soundness
- New resolution-based QBF calculi and their proof complexity
- On Unification of QBF Resolution-Based Calculi
- On the correspondence between arithmetic theories and propositional proof systems – a survey
- Proof Complexity
- Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness
- QBF Resolution Systems and Their Proof Complexities
- Quantified propositional calculi and fragments of bounded arithmetic
- Resolution for quantified Boolean formulas
- Solution validation and extraction for QBF preprocessing
- Solving QBF with counterexample guided refinement
- The relative efficiency of propositional proof systems
- Understanding cutting planes for QBFs
- Unified QBF certification and its applications
This page was built for publication: Towards Uniform Certification in QBF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151563)
