Pages that link to "Item:Q3192183"

The following pages link to A Unified Proof System for QBF Preprocessing (Q3192183):

Displaying 22 items.

• Quantified maximum satisfiability (Q272016) (← links)
• The QBF Gallery: behind the scenes (Q286397) (← links)
• Formal correctness of a quadratic unification algorithm (Q877825) (← links)
• Soundness of \(\mathcal{Q}\)-resolution with dependency schemes (Q896919) (← links)
• The Qu-Prolog unification algorithm: formalisation and correctness (Q1349886) (← links)
• Dual proof generation for quantified Boolean formulas with a BDD-based solver (Q2055876) (← links)
• How QBF expansion makes strategy extraction hard (Q2096438) (← links)
• Hardness and optimality in QBF proof systems modulo NP (Q2118289) (← links)
• Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
• Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
• Long-distance Q-resolution with dependency schemes (Q2417950) (← links)
• Incremental Determinization (Q2818028) (← 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)
• On QBF Proofs and Preprocessing (Q2870148) (← links)
• On Unification of QBF Resolution-Based Calculi (Q2922598) (← links)
• (Q4553279) (← links)
• CAQE and QuAbS: Abstraction Based QBF Solvers (Q5015608) (← links)
• Inconsistency Proofs for ASP: The ASP - DRUPE Format (Q5108508) (← links)
• SAT-Inspired Eliminations for Superposition (Q5875949) (← links)
• Moving definition variables in quantified Boolean formulas (Q6535574) (← links)