Cited in
(42)- Q-resolution with generalized axioms
- Theory and Applications of Satisfiability Testing
- Dependency schemes for DQBF
- A Compact Representation for Syntactic Dependencies in QBFs
- Predicate Elimination for Preprocessing in First-Order Theorem Proving
- A self-adaptive multi-engine solver for quantified Boolean formulas
- Beyond CNF: A Circuit-Based QBF Solver
- Symbolic algorithmic verification of intransitive generalized noninterference
- Failed literal detection for QBF
- Backdoor sets of quantified Boolean formulas
- QuBE++
- NiVER
- sQueezeBF
- Quaffle
- Bloqqer
- Nenofex
- DepQBF
- HeerHugo
- QBFLIB
- QUBOS
- CirQit2
- QUBE
- QuteSAT
- Coprocessor
- Spybug
- CAQE
- semprop
- KoMeT
- sKizzo
- Efficiently solving quantified bit-vector formulas
- RAReQS
- Solving quantified constraint satisfaction problems
- Incremental determinization
- Models and quantifier elimination for quantified Horn formulas
- Ranking function synthesis for bit-vector relations
- Preprocessing for DQBF
- Solution validation and extraction for QBF preprocessing
- A Unified Framework for Certificate and Compilation for QBF
- A solver for QBFs in negation normal form
- Learning to integrate deduction and search in reasoning about quantified Boolean formulas
- Blocked clause elimination for QBF
- QESTO
This page was built for software: Quantor
