The following pages link to Quaffle (Q19323):
Displaying 50 items.
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- Quantified maximum satisfiability (Q272016) (← links)
- The QBF Gallery: behind the scenes (Q286397) (← links)
- Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
- An effective algorithm for the futile questioning problem (Q812439) (← links)
- Deciding Boolean algebra with Presburger arithmetic (Q861705) (← links)
- A solver for QBFs in negation normal form (Q1020501) (← links)
- Building strategies into QBF proofs (Q2031411) (← links)
- Lower bounds for QCDCL via formula gauge (Q2118284) (← links)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) (Q2321317) (← links)
- Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
- Long-distance Q-resolution with dependency schemes (Q2417950) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- Unified QBF certification and its applications (Q2441712) (← links)
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant (Q2473386) (← links)
- A simple proof of QBF hardness (Q2656352) (← links)
- On Q-Resolution and CDCL QBF Solving (Q2818030) (← links)
- 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)
- (Q3005896) (← links)
- Lower Bound Techniques for QBF Proof Systems (Q3304096) (← links)
- From (Quantified) Boolean Formulae to Answer Set Programming (Q3395260) (← links)
- Evaluating and certifying QBFs: A comparison of state-of-the-art tools (Q3400890) (← links)
- (Q3429018) (← links)
- Feasible Interpolation for QBF Resolution Calculi (Q3448783) (← links)
- QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving (Q3453239) (← links)
- Using SAT in QBF (Q3524206) (← links)
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers (Q3527695) (← links)
- A First Step Towards a Unified Proof Checker for QBF (Q3612467) (← links)
- Bounded Universal Expansion for Preprocessing QBF (Q3612470) (← links)
- (Q3624018) (← links)
- A Compact Representation for Syntactic Dependencies in QBFs (Q3637175) (← links)
- Automated Testing and Debugging of SAT and QBF Solvers (Q4930578) (← links)
- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning (Q4930581) (← links)
- A Non-prenex, Non-clausal QBF Solver with Game-State Learning (Q4930584) (← links)
- Integrating Dependency Schemes in Search-Based QBF Solvers (Q4930586) (← links)
- (Q5020558) (← links)
- Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers (Q5170277) (← links)
- (Q5270089) (← links)
- Computer Aided Verification (Q5312917) (← links)
- Theory and Applications of Satisfiability Testing (Q5325863) (← links)
- Theory and Applications of Satisfiability Testing (Q5325879) (← links)
- Theory and Applications of Satisfiability Testing (Q5325883) (← links)
- SAT-Solving Based on Boundary Point Elimination (Q5391525) (← links)
- Model Checking Software (Q5394555) (← links)
- Inconsistency Tolerance (Q5464028) (← links)
