2QBF is a restriction of QBF, in which at most one quantifier alternation is allowed. This simplifying assumption makes the problem easier to reason about, and allows for simpler unit propagation and clause/cube learning procedures.We introduce two new 2QBF algorithms that take advantage of 2QBF specifically. The first improves upon earlier work by Ranjan, Tang, and Malik (2004), while the second introduces a new 'free' decision heuristic that doesn't need to respect quantifier order. Implementations of both new algorithms perform better than two state-of-the-art general QBF solvers on formal verification and AI planning instances. © 2012 Springer-Verlag.
CITATION STYLE
Bayless, S., & Hu, A. J. (2012). Single-solver algorithms for 2QBF (Poster presentation). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7317 LNCS, pp. 487–488). https://doi.org/10.1007/978-3-642-31612-8_48
Mendeley helps you to discover research relevant for your work.