dynQBF
A dynamic programming-based QBF solver
About
dynQBF is an expansion-based QBF solver for instances in prenex CNF form. First,
the CNF matix is split into subproblems by constructing a tree decomposition.
The QBF is then solved by dynamic programming over the tree decomposition. While
the structure of the CNF is reflected by the tree decomposition, structure within
the prefix is considered by integrating dependency schemes in the solving process.
Furthermore, dynQBF uses nested sets of binary decision diagrams (BDDs) to
efficiently store intermediate results.
Downloads
Releases:
The latest releases (including source code) are available at:
Github .
Current evaulation instances:
Old evaluation instances:
References
2019
- Günther Charwat and Stefan Woltran Expansion-based QBF Solving on Tree Decompositions In Sumbitted to Fundamenta Informaticae, 2019.
[ Abstract | BibTeX | pdf ]
2017
- Günther Charwat and Stefan Woltran Expansion-based QBF Solving on Tree Decompositions In Proc. of the 24th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA@AI*IA 2017), Volume 2011 of CEUR Workshop Proceedings, pages 16-26, CEUR-WS.org, 2017.
[ BibTeX | pdf ] - Günther Charwat BDD-based Dynamic Programming on Tree Decompositions - Towards an Alternative Approach for Efficient QBF Solving Ph.D. Thesis, Fakultät für Informatik an der Technischen Universität Wien, 2017.
Stefan Woltran advisor.
[ Abstract | BibTeX ]
2016
- Günther Charwat and Stefan Woltran BDD-based Dynamic Programming on Tree Decompositions Technical Report DBAI-TR-2016-95, DBAI, Fakultät für Informatik an der Technischen Universität Wien, 2016.
[ Abstract | BibTeX | pdf ] - Günther Charwat and Stefan Woltran Dynamic Programming-based QBF Solving In Proc. of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016), Volume 1719 of CEUR Workshop Proceedings, pages 27-40, CEUR-WS.org, 2016.
[ Abstract | BibTeX | pdf ]
Top
Last updated: 2017-07-03 16:06