Cited in
(90)- Q-resolution with generalized axioms
- Long distance Q-resolution with dependency schemes
- Solving QBF with counterexample guided refinement
- The QBF Gallery: behind the scenes
- A First Step Towards a Unified Proof Checker for QBF
- Theory and Applications of Satisfiability Testing
- Logic-based ontology comparison and module extraction, with an application to DL-Lite
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
- Quantified maximum satisfiability
- A Compact Representation for Syntactic Dependencies in QBFs
- Lower bounds for QCDCL via formula gauge
- scientific article; zbMATH DE number 7453115 (Why is no real title available?)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- Feasible interpolation for QBF resolution calculi
- Theory and Applications of Satisfiability Testing
- Lifting QBF resolution calculi to DQBF
- 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
- Building strategies into QBF proofs
- Inconsistency Tolerance
- 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
- GNT
- Qprop
- QuBE++
- BerkMin
- sQueezeBF
- Bloqqer
- Nenofex
- DepQBF
- QBFLIB
- QUBOS
- SATORI
- QUBE
- QMiraXT
- MOCHA
- Velev SAT Benchmarks
- HordeQBF
- MPIDepQBF
- AIGSolve
- CAQE
- Quantor
- HQSpre
- semprop
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- sKizzo
- Expansion-based QBF solving versus Q-resolution
- Theory and Applications of Satisfiability Testing
- On Q-resolution and CDCL QBF solving
- Unified QBF certification and its applications
- Clause/Term resolution and learning in the evaluation of quantified Boolean formulas
- Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares
- RAReQS
- Convergence testing in term-level bounded model checking
- Evaluating and certifying QBFs: a comparison of state-of-the-art tools
- Proof complexity of symbolic QBF reasoning
- Automated testing and debugging of SAT and QBF solvers
- Integrating dependency schemes in search-based QBF solvers
- Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
- Deciding Boolean algebra with Presburger arithmetic
- Efficiently representing existential dependency sets for expansion-based QBF solvers
- 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
- Feasible interpolation for QBF resolution calculi
- A simple proof of QBF hardness
- Using SAT in QBF
- Bounded Universal Expansion for Preprocessing QBF
- PReLearn
- QBFFam
- On Stronger Calculi for QBFs
- From (Quantified) Boolean Formulae to Answer Set Programming
- Lower bound techniques for QBF proof systems
- 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
- scientific article; zbMATH DE number 5139037 (Why is no real title available?)
- Model Checking Software
- Long-distance Q-resolution with dependency schemes
- Computer Aided Verification
- HordeQBF: a modular and massively parallel QBF solver
- sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning
- SAT-solving based on boundary point elimination
- QESTO
- An effective algorithm for the futile questioning problem
- SaDiCaL
This page was built for software: Quaffle
