Pages that link to "Item:Q2339467"

The following pages link to Expansion-based QBF solving versus Q-resolution (Q2339467):

Displaying 39 items.

• Solving QBF with counterexample guided refinement (Q253964) (← links)
• The QBF Gallery: behind the scenes (Q286397) (← links)
• Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable (Q903199) (← links)
• Relating size and width in variants of Q-resolution (Q1653019) (← links)
• Understanding cutting planes for QBFs (Q1784953) (← links)
• Lower bound techniques for QBF expansion (Q1987510) (← links)
• Building strategies into QBF proofs (Q2031411) (← links)
• Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378) (← links)
• How QBF expansion makes strategy extraction hard (Q2096438) (← links)
• QBFFam: a tool for generating QBF families from proof complexity (Q2118282) (← links)
• Lower bounds for QCDCL via formula gauge (Q2118284) (← links)
• Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
• Characterising tree-like Frege proofs for QBF (Q2272983) (← links)
• Reinterpreting dependency schemes: soundness meets incompleteness in DQBF (Q2323446) (← links)
• Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
• Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
• A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
• A simple proof of QBF hardness (Q2656352) (← links)
• On Q-Resolution and CDCL QBF Solving (Q2818030) (← links)
• Q-Resolution with Generalized Axioms (Q2818032) (← links)
• Lifting QBF Resolution Calculi to DQBF (Q2818035) (← links)
• Lower Bound Techniques for QBF Proof Systems (Q3304096) (← links)
• (Q3304106) (← links)
• (Q3384880) (← links)
• Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
• (Q4625701) (← links)
• (Q4625702) (← links)
• Size, cost and capacity: a semantic technique for hard random QBFs (Q4993272) (← links)
• On Exponential Lower Bounds for Partially Ordered Resolution (Q5015597) (← links)
• CAQE and QuAbS: Abstraction Based QBF Solvers (Q5015608) (← links)
• (Q5136303) (← links)
• Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
• Understanding and extending incremental determinization for 2QBF (Q6039407) (← links)
• Lower bounds for QCDCL via formula gauge (Q6053848) (← links)
• Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution (Q6135750) (← links)
• Towards Uniform Certification in QBF (Q6151563) (← links)
• Classes of hard formulas for QBF resolution (Q6488807) (← links)
• Should Decisions in QCDCL Follow Prefix Order? (Q6493568) (← links)
• QBF merge resolution is powerful but unnatural (Q6635504) (← links)