scientific article; zbMATH DE number 7029312
From MaRDI portal
Publication:4625702
Luke Hinde, Olaf Beyersdorff, Joshua Blinkhorn
Publication date: 25 February 2019
Full work available at URL: https://arxiv.org/abs/1712.03626
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Hardness Characterisations and Size-width Lower Bounds for QBF Resolution, Proof complexity of modal resolution, A simple proof of QBF hardness, Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution, Lower bound techniques for QBF expansion, Lower bounds for QCDCL via formula gauge, Characterising tree-like Frege proofs for QBF, Building strategies into QBF proofs, Unnamed Item, QBFFam: a tool for generating QBF families from proof complexity, Lower bounds for QCDCL via formula gauge, Proof complexity of symbolic QBF reasoning
Cites Work
- Towards NP-P via proof complexity and search
- On the complexity of cutting-plane proofs
- Random CNF's are hard for the polynomial calculus
- A threshold for unsatisfiability
- The intractability of resolution
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
- Understanding cutting planes for QBFs
- Resolution for quantified Boolean formulas
- Expansion-based QBF solving versus Q-resolution
- Conformant planning as a case study of incremental QBF solving
- Unified QBF certification and its applications
- A characterization of tree-like resolution size
- A Game Characterisation of Tree-like Q-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
- SAT-Based Synthesis Methods for Safety Specs
- Space Complexity in Propositional Calculus
- A new upper bound for 3-SAT
- QBF Resolution Systems and Their Proof Complexities
- Evaluating and certifying QBFs: A comparison of state-of-the-art tools
- 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
- Are Short Proofs Narrow? QBF Resolution Is Not So Simple
- Understanding Gentzen and Frege Systems for QBF
- Contributions to the Theory of Practical Quantified Boolean Formula Solving
- Automated Testing and Debugging of SAT and QBF Solvers
- Proof Complexity Modulo the Polynomial Hierarchy
- Exact location of the phase transition for random (1,2)-QSAT
- Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds
- The Complexity of Propositional Proofs
- Theory and Applications of Satisfiability Testing
- Random 2-SAT: Results and problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
