Blocked Clause Elimination for QBF
Quantified Boolean formulas (QBF) provide a powerful framework for encoding problems from various application domains, not least because efficient QBF solvers are available. Despite sophisticated evaluation techniques, the performance of such a solver usually depends on the way a problem is represented. However, the translation to processable QBF encodings is in general not unique and may either introduce variables and clauses not relevant for the solving process or blur information which could be beneficial for the solving process. To deal with both of these issues, preprocessors have been introduced which rewrite a given QBF before it is passed to a solver.
In this paper, we present novel preprocessing methods for QBF based on blocked clause elimination (BCE), a technique successfully applied in SAT. Quantified blocked clause elimination (QBCE) allows to simulate various structural preprocessing techniques as BCE in SAT. We have implemented QBCE and extensions of QBCE in the preprocessor bloqqer. In our experiments we show that preprocessing with QBCE reduces formulas substantially and allows us to solve considerable more instances than the previous state-of-the-art.
KeywordsRelated Clause Boolean Formula Propositional Formula Satisfying Assignment Unit Clause
Unable to display preview. Download preview PDF.
- 7.Giunchiglia, E., Marin, P., Narizzano, M.: QuBE 7.0. JSAT 7, 83–88 (2010)Google Scholar
- 10.Heule, M., Järvisalo, M., Biere, A.: Covered Clause Elimination. CoRR, abs/1011.5202 (2010); Short paper proceedings LPAR-17Google Scholar
- 14.Lonsing, F., Biere, A.: DepQBF: A Dependency-Aware QBF Solver (System Description). JSAT 7, 71–76 (2010)Google Scholar
- 15.Mangassarian, H., Le, B., Goultiaeva, A., Veneris, A.G., Bacchus, F.: Leveraging Dominators for Preprocessing QBF. In: Design, Automation and Test in Europe (DATE 2010), pp. 1695–1700. IEEE, Los Alamitos (2010)Google Scholar
- 16.Ostrowski, R., Grgoire, E., Mazure, B., Saïs, L.: Recovering and Exploiting Structural Knowledge from CNF Formulas. In: Proc. of the 8th Int. Conf. on Princ. and Pract. of Constraint Prog (CP 2002), pp. 199–206. Springer, Heidelberg (2006)Google Scholar
- 17.Pigorsch, F., Scholl, C.: An AIG-Based QBF-Solver Using SAT for Preprocessing. In: Proc. of the 47th Design Aut. Conf (DAC 2010), pp. 170–175 (2010)Google Scholar
- 20.Tseitin, G.S.: On the Complexity of Derivation in Propositional Calculus. Studies in Constructive Mathematics and Mathematical Logic 2(115-125), 10–13 (1968)Google Scholar