QBF merge resolution is powerful but unnatural
From MaRDI portal
(Redirected from Publication:6635504)
Cites work
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- A Machine-Oriented Logic Based on the Resolution Principle
- Building strategies into QBF proofs
- Contributions to the theory of practical quantified Boolean formula solving
- Davis and Putnam meet Henkin: solving DQBF with resolution
- Expansion-based QBF solving versus Q-resolution
- Extending merge resolution to a family of QBF-proof systems
- Frege systems for quantified Boolean logic
- GRASP: a search algorithm for propositional satisfiability
- Hard examples for resolution
- Hardness and optimality in QBF proof systems modulo NP
- scientific article; zbMATH DE number 7029312 (Why is no real title available?)
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- Long-distance resolution: proof generation and strategy extraction in search-based QBF solving
- New resolution-based QBF calculi and their proof complexity
- On sufficient conditions for unsatisfiability of random formulas
- Proof Complexity
- QBF Resolution Systems and Their Proof Complexities
- Resolution for quantified Boolean formulas
- The relative efficiency of propositional proof systems
- Towards Uniform Certification in QBF
- Understanding cutting planes for QBFs
- Unified QBF certification and its applications
This page was built for publication: QBF merge resolution is powerful but unnatural
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635504)
