DQBDD: An Efficient BDD-Based DQBF Solver

SÍČ, Juraj and Jan STREJČEK. DQBDD: An Efficient BDD-Based DQBF Solver. Online. 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, 2021, p. 535-544. ISBN 978-3-030-80222-6. Available from: https://dx.doi.org/10.1007/978-3-030-80223-3_36.

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

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10200 1.2 Computer and information sciences

Country of publisher

Switzerland

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

electronic version available online

References:

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

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

---

Abstract

V originále

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.