Publication Details

DQBDD: An Efficient BDD-Based DQBF Solver

SÍČ, J.; STREJČEK, J. DQBDD: An Efficient BDD-Based DQBF Solver. In Proc. of the 24th International Conference on Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2021. p. 535-544. ISSN: 0302-9743.
Czech title
DQBDD: efektivní DQBF řešič založen na BDD
Type
conference paper
Language
English
Authors
Síč Juraj, Mgr. (DITS)
Strejček Jan, prof. RNDr., Ph.D. (FIT)
URL
Keywords

BDD, DQBF, DQBDD, solver

Abstract

This paper introduces a new DQBF solver called DQBF, which is based on quantifier localization, quantifier elimination, and translation of formulas to binary decision diagrams (BDDs). In 2020, DQBF participated for the first time in the Competitive Evaluation of QBF Solvers (QBFEVAL'20) and won the DQBF Solvers Track by a large margin.

Published
2021
Pages
535–544
Journal
Lecture Notes in Computer Science, no. 12831, ISSN 0302-9743
Proceedings
Proc. of the 24th International Conference on Theory and Applications of Satisfiability Testing
Publisher
Springer Verlag
Place
Heidelberg
DOI
10.1007/978-3-030-80223-3_36
UT WoS
000709570900036
EID Scopus
2-s2.0-85112166650
BibTeX 
@inproceedings{BUT175796,
  author="Juraj {Síč} and Jan {Strejček}",
  title="DQBDD: An Efficient BDD-Based DQBF Solver",
  booktitle="Proc. of the 24th International Conference on Theory and Applications of Satisfiability Testing",
  year="2021",
  journal="Lecture Notes in Computer Science",
  number="12831",
  pages="535--544",
  publisher="Springer Verlag",
  address="Heidelberg",
  doi="10.1007/978-3-030-80223-3\{_}36",
  issn="0302-9743",
  url="http://dx.doi.org/10.1007/978-3-030-80223-3_36"
}
Back to top