swMATH766MaRDI QIDQ13515FDOQ13515
Author name not available (Why is that?)
Official website: http://rd.springer.com/chapter/10.1007%2F978-3-540-30494-4_15
Cited In (35)
- Solving QBF with counterexample guided refinement
- A Compact Representation for Syntactic Dependencies in QBFs
- Ranking function synthesis for bit-vector relations
- Beyond CNF: A Circuit-Based QBF Solver
- Abstraction-based algorithm for 2QBF
- An empirical study of QBF encodings: from treewidth estimation to useful preprocessing
- Antichain-Based QBF Solving
- Message passing algorithm for solving QBF using more reasoning
- Clause/Term resolution and learning in the evaluation of quantified Boolean formulas
- Efficiently solving quantified bit-vector formulas
- Theory and Applications of Satisfiability Testing
- ARMC
- PaQuBE
- sQueezeBF
- Quaffle
- Evaluating and certifying QBFs: a comparison of state-of-the-art tools
- Title not available (Why is that?)
- QBFLIB
- QUBOS
- CirQit2
- QUBE
- QuteSAT
- Automated testing and debugging of SAT and QBF solvers
- Quantor
- semprop
- Ranking function synthesis for bit-vector relations
- On deciding subsumption problems
- 2QBF: challenges and solutions
- sKizzo
- Theory and Applications of Satisfiability Testing
- A complexity perspective on entailment of parameterized linear constraints
- Computational methods for database repair by signed formulae
- Lower bound techniques for QBF proof systems
- Compressing BMC encodings with QBF
- Backjumping for quantified Boolean logic satisfiability
This page was built for software: QuBE++
