Pages that link to "Item:Q1891159"

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

Displaying 41 items.

• On Stronger Calculi for QBFs (Q2818031) (← links)
• Q-Resolution with Generalized Axioms (Q2818032) (← links)
• Lifting QBF Resolution Calculi to DQBF (Q2818035) (← links)
• Long Distance Q-Resolution with Dependency Schemes (Q2818036) (← links)
• HordeQBF: A Modular and Massively Parallel QBF Solver (Q2818039) (← links)
• Backdoors to Satisfaction (Q2908542) (← links)
• Generalized Craig Interpolation for Stochastic Boolean Satisfiability Problems (Q3000643) (← links)
• Failed Literal Detection for QBF (Q3007688) (← links)
• On the Exact Complexity of Evaluating Quantified k-CNF (Q3058691) (← links)
• Validating QBF Validity in HOL4 (Q3088005) (← links)
• On the restricted equivalence for subclasses of propositional logic (Q3142267) (← links)
• Lower Bound Techniques for QBF Proof Systems (Q3304096) (← links)
• (Q3304106) (← links)
• Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
• QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving (Q3453239) (← links)
• Quantified Constraint Satisfaction and the Polynomially Generated Powers Property (Q3519502) (← links)
• A Unified Framework for Certificate and Compilation for QBF (Q3601811) (← links)
• Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits (Q3637174) (← links)
• A Compact Representation for Syntactic Dependencies in QBFs (Q3637175) (← links)
• BDD-based decision procedures for the modal logic K ★ (Q3647260) (← links)
• Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas (Q3655211) (← links)
• (Q4625702) (← links)
• Size, cost and capacity: a semantic technique for hard random QBFs (Q4993272) (← links)
• Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
• The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 (Q5015602) (← links)
• CAQE and QuAbS: Abstraction Based QBF Solvers (Q5015608) (← links)
• On Quantifying Literals in Boolean Logic and its Applications to Explainable AI (Q5026182) (← links)
• (Q5090460) (← links)
• (Q5136303) (← links)
• Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers (Q5170277) (← links)
• Blocked Clause Elimination for QBF (Q5200018) (← links)
• Hardness Characterisations and Size-width Lower Bounds for QBF Resolution (Q5886517) (← links)
• Lower bounds for QCDCL via formula gauge (Q6053848) (← links)
• Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution (Q6135750) (← links)
• Capturing the polynomial hierarchy by second-order revised Krom logic (Q6135775) (← 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)
• Moving definition variables in quantified Boolean formulas (Q6535574) (← links)
• Reasoning with propositional logic: from SAT solvers to knowledge compilation (Q6602252) (← links)
• QBF merge resolution is powerful but unnatural (Q6635504) (← links)