Abstract
Algorithm portfolios try to combine the strength of individual algorithms to tackle a problem instance at hand with the most suitable technique. In the context of SAT the effectiveness of such approaches is often demonstrated at the SAT Competitions. In this paper we show that a competitive algorithm portfolio can be designed in an extremely simple fashion. In fact, the algorithm portfolio we present does not require any offline learning nor knowledge of any complex Machine Learning tools. We hope that the utter simplicity of our approach combined with its effectiveness will make algorithm portfolios accessible by a broader range of researchers including SAT and CSP solver developers.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Amadini, R., Gabbrielli, M., Mauro, J.: An empirical evaluation of portfolios approaches for solving csps. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 316–324. Springer, Heidelberg (2013)
Audemard, G., Simon, L.: Predicting learnt clauses quality in modern sat solver. In: IJCAI 2009 (July 2009)
Biere, A.: Lingeling and friends at the sat competition 2011. Technical report, Johannes Kepler University, Altenbergerstr. 69, 4040 Linz, Austria (2011)
Cnrs, L.: Choco: an open source java constraint programming library. In: White Paper 14th International Conference on Principles and Practice of Constraint Programming CPAI 2008 Competition, pp. 7–14 (2008), http://www.emn.fr/z-info/choco-solver/pdf/choco-presentation.pdf
Gecode Team. Gecode: Generic constraint development environment (2006), http://www.gecode.org
Gomes, C., Selman, B.: Algorithm portfolios. Artificial Intelligence Journal 126(1-2), 43–62 (2001)
Huda, M.S., Alam, K.M.R., Mutsuddi, K., Rahman, M.K.S., Rahman, C.M.: A dynamic k-nearest neighbor algorithm for pattern analysis problem. In: 3rd International Conference on Electrical & Computer Engineering (2004)
Rice, J.R.: The algorithm selection problem. Advances in Computers 15, 65–118 (1976)
Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm selection and scheduling. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 454–469. Springer, Heidelberg (2011)
Leyton-Brown, K., Nudelman, E., Andrew, G., McFadden, J., Shoham, Y.: A portfolio approach to algorithm selection. In: Proc. of the 15th Int. Joint Conference on Artificial Intelligence (IJCAI), pp. 1542–1543 (2003)
O’Mahony, E., Hebrard, E., Holland, A., Nugent, C., O’Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Irish Conference on Artificial Intelligence and Cognitive Science (2008)
Soos, M.: CryptoMiniSat 3.1 (2013), http://www.msoos.org/cryptominisat2
Sorensson, N., Een, N.: MiniSAT 2.2.0 (2010), http://minisat.se
Stern, D., Samulowitz, H., Herbrich, R., Graepel, T., Pulina, L., Tacchella, A.: Collaborative expert portfolio management. In: AAAI (2010)
Streeter, M., Smith, S.: Using decision procedures efficiently for optimization. In: ICAPS, pp. 312–319 (2007)
Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Satzilla: Portfolio-based algorithm selection for sat. JAIR 32(1), 565–606 (2008)
Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Evaluating component solver contributions to portfolio-based algorithm selectors. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 228–241. Springer, Heidelberg (2012)
Xu, L., Hutter, F., Shen, J., Hoos, H., Leyton-Brown, K.: Satzilla2012: Improved algorithm selection based on cost-sensitive classification models. solver description. In: SAT Challenge 2012 (2012b)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Samulowitz, H., Reddy, C., Sabharwal, A., Sellmann, M. (2013). Snappy: A Simple Algorithm Portfolio. In: Järvisalo, M., Van Gelder, A. (eds) Theory and Applications of Satisfiability Testing – SAT 2013. SAT 2013. Lecture Notes in Computer Science, vol 7962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39071-5_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-39071-5_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39070-8
Online ISBN: 978-3-642-39071-5
eBook Packages: Computer ScienceComputer Science (R0)