On Q-Resolution and CDCL QBF Solving

  title={On Q-Resolution and CDCL QBF Solving},
  author={Mikol{\'a}s Janota},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
Q-resolution and its variations provide the underlying proof systems for the DPLL-based QBF solvers. While (long-distance) Q-resolution models a conflict driven clause learning (CDCL) QBF solver, it is not known whether the inverse is also true. This paper provides a negative answer to this question. This contrasts with SAT solving, where CDCL solvers have been shown to simulate resolution. 


Publications citing this paper.
Showing 1-7 of 7 extracted citations

Dependency Learning for QBF

View 5 Excerpts
Highly Influenced

More on Size and Width in QBF Resolution

Electronic Colloquium on Computational Complexity • 2018
View 3 Excerpts

A Duality-Aware Calculus for Quantified Boolean Formulas

2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) • 2016
View 1 Excerpt

Similar Papers

Loading similar papers…