Dependency schemes in CDCL-based QBF solving: a proof-theoretic study
From MaRDI portal
Cites work
- Backdoor sets of quantified Boolean formulas
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
- Dependency Learning for QBF
- Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications
- Dependency schemes in CDCL-based QBF solving: a proof-theoretic study
- Dynamic QBF dependencies in reduction and expansion
- Handbook of satisfiability. In 2 parts
- scientific article; zbMATH DE number 7029312 (Why is no real title available?)
- Integrating dependency schemes in search-based QBF solvers
- Long-distance Q-resolution with dependency schemes
- Lower bounds for multiplayer noncooperative games of incomplete information
- New resolution-based QBF calculi and their proof complexity
- On the power of clause-learning SAT solvers as resolution engines
- QCDCL vs QBF resolution: further insights
- Shortening QBF proofs with dependency schemes
- Should decisions in QCDCL follow prefix order?
- Soundness of \(\mathcal{Q}\)-resolution with dependency schemes
- Strong (D)QBF dependency schemes via tautology-free resolution paths
- Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
This page was built for publication: Dependency schemes in CDCL-based QBF solving: a proof-theoretic study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951695)
