Relating size and width in variants of Q-resolution
From MaRDI portal
Publication:1653019
Recommendations
Cites work
- A Computing Procedure for Quantification Theory
- A Machine-Oriented Logic Based on the Resolution Principle
- A machine program for theorem-proving
- Are Short Proofs Narrow? QBF Resolution Is Not So Simple
- Contributions to the theory of practical quantified Boolean formula solving
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
- Expansion-based QBF solving versus Q-resolution
- Feasible interpolation for QBF resolution calculi
- Long-distance resolution: proof generation and strategy extraction in search-based QBF solving
- Lower bounds: from circuits to QBF proof systems
- On Q-resolution and CDCL QBF solving
- QBF Resolution Systems and Their Proof Complexities
- Resolution for quantified Boolean formulas
- Short proofs are narrow—resolution made simple
- Towards NP-P via proof complexity and search
- Unified QBF certification and its applications
Cited in
(5)
This page was built for publication: Relating size and width in variants of Q-resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1653019)