swMATH7278MaRDI QIDQ19323FDOQ19323
Author name not available (Why is that?)
Official website: http://www.princeton.edu/~chaff/quaffle.html
Cited In (90)
- A Compact Representation for Syntactic Dependencies in QBFs
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Theory and Applications of Satisfiability Testing
- Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares
- Convergence testing in term-level bounded model checking
- Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
- From (Quantified) Boolean Formulae to Answer Set Programming
- A First Step Towards a Unified Proof Checker for QBF
- Solving QBF with counterexample guided refinement
- The QBF Gallery: behind the scenes
- Theory and Applications of Satisfiability Testing
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Quantified maximum satisfiability
- Lower bounds for QCDCL via formula gauge
- Title not available (Why is that?)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- RAReQS
- Feasible interpolation for QBF resolution calculi
- A non-prenex, non-clausal QBF solver with game-state learning
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Lifting QBF resolution calculi to DQBF
- Inconsistency Tolerance
- Building strategies into QBF proofs
- QESTO
- QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency
- A game characterisation of tree-like Q-resolution size
- An empirical study of QBF encodings: from treewidth estimation to useful preprocessing
- Expansion-based QBF solving versus Q-resolution
- On Q-resolution and CDCL QBF solving
- Clause/Term resolution and learning in the evaluation of quantified Boolean formulas
- Unified QBF certification and its applications
- GNT
- Qprop
- QuBE++
- BerkMin
- sQueezeBF
- Evaluating and certifying QBFs: a comparison of state-of-the-art tools
- Bloqqer
- Nenofex
- DepQBF
- QBFLIB
- QUBOS
- SATORI
- QUBE
- QMiraXT
- MOCHA
- Velev SAT Benchmarks
- Proof complexity of symbolic QBF reasoning
- Automated testing and debugging of SAT and QBF solvers
- Integrating dependency schemes in search-based QBF solvers
- HordeQBF
- MPIDepQBF
- AIGSolve
- CAQE
- Quantor
- HQSpre
- semprop
- Efficiently representing existential dependency sets for expansion-based QBF solvers
- Deciding Boolean algebra with Presburger arithmetic
- QELL: QBF reasoning with extended clause learning and levelized SAT solving
- Using stochastic local search to solve quantified Boolean formulae
- Theory and Applications of Satisfiability Testing
- sKizzo
- SaDiCaL
- Feasible interpolation for QBF resolution calculi
- A simple proof of QBF hardness
- Using SAT in QBF
- Bounded Universal Expansion for Preprocessing QBF
- On Stronger Calculi for QBFs
- Lower bound techniques for QBF proof systems
- PReLearn
- QBFFam
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- A solver for QBFs in negation normal form
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- Model Checking Software
- Computer Aided Verification
- Long-distance Q-resolution with dependency schemes
- sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning
- HordeQBF: a modular and massively parallel QBF solver
- SAT-solving based on boundary point elimination
- An effective algorithm for the futile questioning problem
- Q-resolution with generalized axioms
- Long distance Q-resolution with dependency schemes
This page was built for software: Quaffle
