Informace o publikaci
DQBDD: An Efficient BDD-Based DQBF Solver
| Autoři | |
|---|---|
| Rok publikování | 2021 |
| Druh | Článek ve sborníku |
| Konference | Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings |
| Fakulta / Pracoviště MU | |
| Citace | |
| www | 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 |
| Klíčová slova | dependency quantified Boolean formulas; DQBF; binary decision diagrams; BDD; DQBDD |
| Popis | 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. |