Publication details
DQBDD: An Efficient BDD-Based DQBF Solver
| Authors | |
|---|---|
| Year of publication | 2021 |
| Type | Article in Proceedings |
| Conference | Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings |
| MU Faculty or unit | |
| Citation | |
| web | https://link.springer.com/chapter/10.1007%2F978-3-030-80223-3_36 |
| Doi | http://dx.doi.org/10.1007/978-3-030-80223-3_36 |
| Keywords | dependency quantified Boolean formulas; DQBF; binary decision diagrams; BDD; DQBDD |
| Description | This paper introduces a new DQBF solver called DQBDD, which is based on quantifier localization, quantifier elimination, and translation of formulas to binary decision diagrams (BDDs). In 2020, DQBDD participated for the first time in the Competitive Evaluation of QBF Solvers (QBFEVAL’20) and won the DQBF Solvers Track by a large margin. |