Cited in
(48)- Computational methods for database repair by signed formulae
- Efficiently solving quantified bit-vector formulas
- \(\mathsf{MPIDepQBF}\): towards parallel QBF solving without knowledge sharing
- Beyond CNF: A Circuit-Based QBF Solver
- RAReQS
- On deciding subsumption problems
- scientific article; zbMATH DE number 1950260 (Why is no real title available?)
- Expansion-based QBF solving versus Q-resolution
- Ranking function synthesis for bit-vector relations
- Lower bound techniques for QBF proof systems
- Compressing BMC encodings with QBF
- Using SAT in QBF
- Backjumping for quantified Boolean logic satisfiability
- Automated reasoning. 1st international joint conference, IJCAR 2001, Siena, Italy, June 18-22, 2001. Proceedings
- HordeQBF: a modular and massively parallel QBF solver
- 2QBF: challenges and solutions
- QuBE++
- Hilberticus
- STRIP
- MUSCADET
- sQueezeBF
- Quaffle
- A Compact Representation for Syntactic Dependencies in QBFs
- Bloqqer
- Nenofex
- DepQBF
- QBFLIB
- QUBOS
- CirQit2
- QuteSAT
- QMiraXT
- MOCHA
- Solving QBF with counterexample guided refinement
- HordeQBF
- MPIDepQBF
- MODPROF
- Quantor
- semprop
- Symbolic computational techniques for solving games
- Mjollnir
- sKizzo
- Abstraction-based algorithm for 2QBF
- Boolean functions as models for quantified Boolean formulas
- Exploiting circuit representations in QBF solving
- On unification for bounded distributive lattices
- Formal Methods in Computer-Aided Design
- Blocked clause elimination for QBF
- Message passing algorithm for solving QBF using more reasoning
This page was built for software: QUBE
