Cited in
(40)- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- Computational methods for database repair by signed formulae
- From QBFs to \textsf{MALL} and back via focussing
- RAReQS
- On deciding subsumption problems
- QESTO
- A solver for QBFs in negation normal form
- Q-resolution with generalized axioms
- HordeQBF: a modular and massively parallel QBF solver
- QuBE++
- sQueezeBF
- Quaffle
- A Compact Representation for Syntactic Dependencies in QBFs
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
- Bloqqer
- Nenofex
- DepQBF
- QUBOS
- SATORI
- Squolem
- CirQit2
- QUBE
- QMiraXT
- The complexity of pure literal elimination
- Spybug
- Solving QBF with counterexample guided refinement
- HordeQBF
- MPIDepQBF
- QBFEVAL
- AIGSolve
- CAQE
- Quantor
- HQSpre
- KoMeT
- sKizzo
- QRATPre+
- Validating QBF Validity in HOL4
- Conformant planning as a case study of incremental QBF solving
- The QBF Gallery: behind the scenes
This page was built for software: semprop
