swMATH25922MaRDI QIDQ37655FDOQ37655
Author name not available (Why is that?)
Official website: https://dl.acm.org/citation.cfm?id=2893554
Cited In (51)
- Boolean functional synthesis: hardness and practical algorithms
- Skolem functions for DQBF
- dCAQE
- Title not available (Why is that?)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- Planning with Incomplete Information in Quantified Answer Set Programming
- RAReQS
- Non-prenex QBF solving using abstraction
- Dependency learning for QBF
- Building strategies into QBF proofs
- QESTO
- Clausal abstraction for DQBF
- Proof complexity of fragments of long-distance Q-resolution
- Solving dependency quantified Boolean formulas using quantifier localization
- QuBE++
- sQueezeBF
- Quaffle
- Bloqqer
- Nenofex
- DepQBF
- QBFLIB
- QUBOS
- CirQit2
- QUBE
- QMiraXT
- MUSer2
- BEACON
- Spybug
- Multi-linear strategy extraction for QBF expansion proofs via local soundness
- Incremental determinization
- Proof complexity of symbolic QBF reasoning
- HordeQBF
- MPIDepQBF
- CoQuiAAS
- QBFEVAL
- Acacia+
- AIGSolve
- Quantor
- HQSpre
- semprop
- \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property
- sKizzo
- SaDiCaL
- Combining resolution-path dependencies with dependency learning
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
- Encodings of bounded synthesis
- Lower bound techniques for QBF proof systems
- QBFFam
- QRATPre+
- Aeon
- Q-resolution with generalized axioms
This page was built for software: CAQE
