DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL

@inproceedings{Lonsing2017DepQBF6A,
  title={DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL},
  author={Florian Lonsing and Uwe Egly},
  booktitle={CADE},
  year={2017}
}
We present the latest version 6.0 of the quantified Boolean formula (QBF) solver DepQBF, which is based on QCDCL. QCDCL is an extension of the conflict-driven clause learning (CDCL) paradigm implemented in state of the art propositional satisfiability (SAT) solvers. The Q-resolution calculus (QRES) is a QBF proof system which underlies QCDCL. QCDCL solvers can produce QRES proofs of QBFs in prenex conjunctive normal form (PCNF) as a byproduct of the solving process. In contrast to traditional… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

Similar Papers

Loading similar papers…