Using SAT in QBF
From MaRDI portal
Recommendations
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2004
- Theory and Applications of Satisfiability Testing
- QELL: QBF reasoning with extended clause learning and levelized SAT solving
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
Cited in
(17)- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
- Solving QBF with counterexample guided refinement
- Q-resolution with generalized axioms
- HordeQBF: a modular and massively parallel QBF solver
- A heuristic survey propagation algorithm for solving QBF problems
- Failed literal detection for QBF
- QELL: QBF reasoning with extended clause learning and levelized SAT solving
- A Unified Framework for Certificate and Compilation for QBF
- Dynamically Partitioning for Solving QBF
- Beyond CNF: A Circuit-Based QBF Solver
- Local redundancy in SAT: generalizations of blocked clauses
- Message passing algorithm for solving QBF using more reasoning
- scientific article; zbMATH DE number 7278086 (Why is no real title available?)
- Theory and Applications of Satisfiability Testing
- Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares
- Using stochastic local search to solve quantified Boolean formulae
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Using SAT in QBF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524206)
