CAQE
From MaRDI portal
Software:37655
swMATH25922MaRDI QIDQ37655FDOQ37655
Author name not available (Why is that?)
Cited In (20)
- Boolean functional synthesis: hardness and practical algorithms
- Skolem functions for DQBF
- 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
- Non-prenex QBF solving using abstraction
- Dependency learning for QBF
- Building strategies into QBF proofs
- Clausal abstraction for DQBF
- Proof complexity of fragments of long-distance Q-resolution
- Solving dependency quantified Boolean formulas using quantifier localization
- Multi-linear strategy extraction for QBF expansion proofs via local soundness
- Incremental determinization
- Proof complexity of symbolic QBF reasoning
- \({\textsf{QRAT}}^{+}\): generalizing QRAT by a more powerful QBF redundancy property
- 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
- Q-resolution with generalized axioms
This page was built for software: CAQE
