We present a method - called quantifier tree reconstruction - that allows to efficiently recover ex-post a portion of the internal structure of QBF instances which was hidden as a consequence of the cast to prenex normal form. Means to profit from a quantifier tree are presented for all the main families of QBF solvers. Experiments on QBFLIB instances are also reported. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Benedetti, M. (2005). Quantifier trees for QBFs. In Lecture Notes in Computer Science (Vol. 3569, pp. 378–385). Springer Verlag. https://doi.org/10.1007/11499107_28
Mendeley helps you to discover research relevant for your work.