Pages that link to "Item:Q1891159"

The following pages link to Resolution for quantified Boolean formulas (Q1891159):

Displaying 50 items.

• Solving QBF with counterexample guided refinement (Q253964) (← links)
• Quantified maximum satisfiability (Q272016) (← links)
• The QBF Gallery: behind the scenes (Q286397) (← links)
• Quantifier reordering for QBF (Q287386) (← links)
• Analyzing restricted fragments of the theory of linear arithmetic (Q513354) (← links)
• Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
• Backjumping for quantified Boolean logic satisfiability (Q814445) (← links)
• The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
• Equilibrium logic (Q854969) (← links)
• Soundness of \(\mathcal{Q}\)-resolution with dependency schemes (Q896919) (← links)
• Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable (Q903199) (← links)
• Models and quantifier elimination for quantified Horn formulas (Q944709) (← links)
• Existentially restricted quantified constraint satisfaction (Q1013082) (← links)
• The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
• A self-adaptive multi-engine solver for quantified Boolean formulas (Q1020496) (← links)
• Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
• A satisfiability procedure for quantified Boolean formulae (Q1408385) (← links)
• Relating size and width in variants of Q-resolution (Q1653019) (← links)
• On deciding subsumption problems (Q1777407) (← links)
• Understanding cutting planes for QBFs (Q1784953) (← links)
• Short proofs for some symmetric quantified Boolean formulas (Q1799597) (← links)
• On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746) (← links)
• Lower bound techniques for QBF expansion (Q1987510) (← links)
• Building strategies into QBF proofs (Q2031411) (← links)
• Dual proof generation for quantified Boolean formulas with a BDD-based solver (Q2055876) (← 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)
• Davis and Putnam meet Henkin: solving DQBF with resolution (Q2118283) (← links)
• Lower bounds for QCDCL via formula gauge (Q2118284) (← links)
• Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
• Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
• Characterising tree-like Frege proofs for QBF (Q2272983) (← links)
• Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
• Reinterpreting dependency schemes: soundness meets incompleteness in DQBF (Q2323446) (← links)
• Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
• Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
• Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic'' (Q2364369) (← links)
• Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
• Long-distance Q-resolution with dependency schemes (Q2417950) (← links)
• A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
• Henkin quantifiers and Boolean formulae: a certification perspective of DQBF (Q2435315) (← links)
• Unified QBF certification and its applications (Q2441712) (← links)
• Bounded-width QBF is PSPACE-complete (Q2453562) (← links)
• Out of order quantifier elimination for standard quantified linear programs (Q2456614) (← links)
• Computational methods for database repair by signed formulae (Q2502158) (← links)
• Boolean functions as models for quantified Boolean formulas (Q2642467) (← links)
• A simple proof of QBF hardness (Q2656352) (← links)
• A Game Characterisation of Tree-like Q-resolution Size (Q2799200) (← links)
• On Q-Resolution and CDCL QBF Solving (Q2818030) (← links)