Abstract
In this paper we study the problem of yielding robust performances from current state-of-the-art solvers for quantified Boolean formulas (QBFs). Building on top of existing QBF solvers, we implement a new multi-engine solver which can inductively learn its solver selection strategy. Experimental results confirm that our solver is always more robust than each single engine, that it is stable with respect to various perturbations, and that such results can be partially explained by a handful of features playing a crucial role in our solver.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: 5th Annual ACM Symposium on the Theory of Computation (1973)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Gent, I.P., Nightingale, P., Rowley, A.: Encoding Quantified CSPs as Quantified Boolean Formulae. In: Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004) (2004)
Jussila, T., Biere, A.: Compressing BMC encodings with QBF. In: Proc. 4th Intl. Workshop on Bounded Model Checking (BMC 2006) (2006)
Ansotegui, C., Gomes, C.P., Selman, B.: Achille’s heel of QBF. In: Proc. of AAAI (2005)
Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. In: Seventeenth National Conference on Artificial Intelligence (AAAI 2000), pp. 417–422. MIT Press, Cambridge (2000)
Narizzano, M., Pulina, L., Taccchella, A.: QBF solvers competitive evaluation (QBFEVAL) (2003-2007), http://www.qbflib.org/qbfeval
Huberman, B.A., Lukose, R.M., Hogg, T.: An economics approach to hard computational problems. Science 3 (1997)
Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence 126 (2001)
Nudelman, E., Leyton-Brown, K., Devkar, A., Shoham, Y., Hoos, H.: SATzilla: An Algorithm Portfolio for SAT. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 13–14. Springer, Heidelberg (2005)
Samulowitz, H., Memisevic, R.: Learning to Solve QBF. In: AAAI 2007. Proc. of 22nd Conference on Artificial Intelligence (2007)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5(7), 394–397 (1962)
Kleine-Büning, H., Karpinski, M., Flögel, A.: Resolution for Quantified Boolean Formulas. Information and Computation 117(1), 12–18 (1995)
Benedetti, M.: sKizzo: a Suite to Evaluate and Certify QBFs. In: Nieuwenhuis, R. (ed.) Automated Deduction – CADE-20. LNCS (LNAI), vol. 3632. Springer, Heidelberg (2005)
Biere, A.: Resolve and Expand. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542. Springer, Heidelberg (2005)
Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantified Boolean Formulas satisfiability library (QBFLIB) (2001), www.qbflib.org
Narizzano, M., Pulina, L., Tacchella, A.: The third QBF solvers comparative evaluation. Journal on Satisfiability, Boolean Modeling and Computation 2, 145–164 (2006), http://jsat.ewi.tudelft.nl/
Kaufman, L., Rousseeeuw, P.J.: Finding Groups in Data. Wiley, Chichester (1990)
Witten, I.H., Frank, E.: Data Mining, 2nd edn. Morgan Kaufmann, San Francisco (2005)
Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)
Cohen, W.W.: Fast effective rule induction. In: Twelfth International Conference on Machine Learning, pp. 115–123 (1995)
Le Cessie, S., van Houwelingen, J.C.: Ridge estimators in logistic regression. Applied Statistics 41, 191–201 (1992)
Aha, D., Kibler, D.: Instance-based learning algorithms. Machine Learning, 37–66 (1991)
Kohavi, R.: A study of cross-validation and bootstrap for accuracy estimation and model selection. In: Proc. of Intl. Joint Conference on Artificial Intelligence (IJCAI) (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pulina, L., Tacchella, A. (2007). A Multi-engine Solver for Quantified Boolean Formulas. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)