scientific article
From MaRDI portal
Publication:3304106
DOI10.4230/LIPIcs.STACS.2018.12zbMath1487.03066MaRDI QIDQ3304106
Olaf Beyersdorff, Joshua Blinkhorn
Publication date: 5 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items (3)
Lower Bound Techniques for QBF Proof Systems ⋮ Lower bound techniques for QBF expansion ⋮ Characterising tree-like Frege proofs for QBF
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving QBF with counterexample guided refinement
- Towards NP-P via proof complexity and search
- Resolution for quantified Boolean formulas
- Expansion-based QBF solving versus Q-resolution
- Conformant planning as a case study of incremental QBF solving
- A characterization of tree-like resolution size
- Lower Bounds
- On Stronger Calculi for QBFs
- Q-Resolution with Generalized Axioms
- Long Distance Q-Resolution with Dependency Schemes
- Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving
- On Unification of QBF Resolution-Based Calculi
- QBF Resolution Systems and Their Proof Complexities
- Linear reasoning. A new form of the Herbrand-Gentzen theorem
- Feasible Interpolation for QBF Resolution Calculi
- Fault Localization and Correction with QBF
- The relative efficiency of propositional proof systems
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
- Short proofs are narrow—resolution made simple
- Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness
- Are Short Proofs Narrow? QBF Resolution is not Simple.
- Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test
- Experiments with Reduction Finding
- The Complexity of Propositional Proofs
- Theory and Applications of Satisfiability Testing
This page was built for publication:
