SÍČ, Juraj and Jan STREJČEK. DQBDD: An Efficient BDD-Based DQBF Solver. In Chu-Min Li and Felip Manyà. Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings. Cham (Switzerland): Springer. p. 535-544. ISBN 978-3-030-80222-6. doi:10.1007/978-3-030-80223-3_36. 2021.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name DQBDD: An Efficient BDD-Based DQBF Solver
Authors SÍČ, Juraj (703 Slovakia) and Jan STREJČEK (203 Czech Republic, guarantor, belonging to the institution).
Edition Cham (Switzerland), Theory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings, p. 535-544, 10 pp. 2021.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10200 1.2 Computer and information sciences
Country of publisher Switzerland
Confidentiality degree is not subject to a state or trade secret
Publication form electronic version available online
WWW URL
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/21:00122203
Organization unit Faculty of Informatics
ISBN 978-3-030-80222-6
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-030-80223-3_36
UT WoS 000709570900036
Keywords in English dependency quantified Boolean formulas; DQBF; binary decision diagrams; BDD; DQBDD
Tags core_A, firank_A, formela-aut, satisfiability, SMT solving
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 23/5/2022 14:57.
Abstract
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.
PrintDisplayed: 29/3/2024 07:45