Understanding cutting planes for QBFs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5542982 (Why is no real title available?)
- scientific article; zbMATH DE number 1215500 (Why is no real title available?)
- scientific article; zbMATH DE number 512977 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1008380 (Why is no real title available?)
- scientific article; zbMATH DE number 1161568 (Why is no real title available?)
- scientific article; zbMATH DE number 1860652 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 7278086 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- A game characterisation of tree-like Q-resolution size
- Analysis of Boolean Functions
- Bounded-width QBF is PSPACE-complete
- Computational Complexity
- Conformant planning as a case study of incremental QBF solving
- Contributions to the theory of practical quantified Boolean formula solving
- Dual weak pigeonhole principle, Boolean complexity, and derandomization
- Edmonds polytopes and weakly hamiltonian graphs
- Expansion-based QBF solving versus Q-resolution
- Feasible interpolation for QBF resolution calculi
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
- Learning curves of the clipped Hebb rule for networks with binary weights
- Logical foundations of proof complexity
- Long-distance resolution: proof generation and strategy extraction in search-based QBF solving
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Lower bounds: from circuits to QBF proof systems
- Non-automatizability of bounded-depth Frege proofs
- On Cutting Planes
- On Unification of QBF Resolution-Based Calculi
- On sequent systems and resolution for QBFs
- On the complexity of cutting-plane proofs
- On the correspondence between arithmetic theories and propositional proof systems – a survey
- Open-WBO: a modular MaxSAT solver
- Polynomial size proofs of the propositional pigeonhole principle
- Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness
- Proof complexity of resolution-based QBF calculi
- QBF Resolution Systems and Their Proof Complexities
- Resolution for quantified Boolean formulas
- Semantic versus syntactic cutting planes
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF
- The Complexity of Propositional Proofs
- The intractability of resolution
- The relative efficiency of propositional proof systems
- Towards NP-P via proof complexity and search
- Understanding Gentzen and Frege Systems for QBF
- Understanding cutting planes for QBFs
- Unified QBF certification and its applications
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
Cited in
(7)- Towards Uniform Certification in QBF
- Efficient reduction of nondeterministic automata with application to language inclusion testing
- How QBF expansion makes strategy extraction hard
- Understanding cutting planes for QBFs
- QBF merge resolution is powerful but unnatural
- Achieving consistency with cutting planes
- scientific article; zbMATH DE number 7029312 (Why is no real title available?)
This page was built for publication: Understanding cutting planes for QBFs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784953)
