[Zurück]

H. Hoos, T. Peitl, F. Slivovsky, S. Szeider:
"Portfolio-Based Algorithm Selection for Circuit QBFs";
in: "Portfolio-Based Algorithm Selection for Circuit QBFs", 173; herausgegeben von: Springer Verlag; Springer-Verlag, 2018, S. 195 - 205.

Abstract. Quantified Boolean Formulas (QBFs) are a generalization of propo-sitional formulae that admits succinct encodings of verification and synthesis problems. Given that modern QBF solvers are based on different architectures with complementary performance characteristics, a portfolio-based approach to QBF solving is particularly promising.
While general QBFs can be converted to prenex conjunctive normal form (PCNF) with small overhead, this transformation has been known to adversely affect performance. This issue has prompted the development of several solvers for circuit QBFs in recent years.
We define a natural set of features of circuit QBFs and show that they can be used to construct portfolio-based algorithm selectors of state-of-the-art circuit QBF solvers that are close to the virtual best solver. We further demonstrate that most of this performance can be achieved using surprisingly small subsets of cheaply computable and intuitive features.

http://dx.doi.org/10.1007/978-3-319-98334-9_13

https://link.springer.com/chapter/10.1007%2F978-3-319-98334-9_13