Abstract
Execution of most of the modern DPLL-based SAT solvers is guided by a number of heuristics. Decisions made during the search process are usually driven by some fixed heuristic policies. Despite the outstanding progress in SAT solving in recent years, there is still an appealing lack of techniques for selecting policies appropriate for solving specific input formulae. In this paper we present a methodology for instance-based selection of solver’s policies that uses a data-mining classification technique. The methodology also relies on analysis of relationships between formulae, their families, and their suitable solving strategies. The evaluation results are very good, demonstrate practical usability of the methodology, and encourage further efforts in this direction.
This work was partially supported by Serbian Ministry of Science grant 144030.
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
Biere, A.: PicoSAT Essentials. Journal on Satisfiability, Boolean Modeling, and Computation (2008)
Cook, S.A.: The Complexity of Theorem-Proving Procedures. In: STOC 1971: Proceedings of the Third Annual ACM Symposium on Theory of Computing. ACM Press, New York (1971)
Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem-Proving. Commun. ACM (1962)
Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. J. ACM (1960)
Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Theory and Applications of Satisfiability Testing (2004)
Gomes, P., Kautz, H., Sabharwal, A., Selman, B.: Satisfiability Solvers. In: Handbook of Knowledge Representation, Elsevier, Amsterdam (2007)
Hutter, F., Babic, D., Hoos, H.H., Hu, A.J.: Boosting Verification by Automatic Tuning of Decision Procedures. In: FMCAD 2007: Proceedings of the Formal Methods in Computer Aided Design, IEEE Computer Society Press, Los Alamitos (2007)
Krstić, S., Goel, A.: Architecting solvers for SAT modulo theories: Nelson-oppen with DPLL. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS, vol. 4720, pp. 1–27. Springer, Heidelberg (2007)
Kibria, R.H.: Evolving a Neural Net-Based Decision and Search Heuristic for DPLL SAT Solvers. In: IJCNN (2007)
Lobjois, L., Lemaitre, M.: Branch and Bound Algorithm Selection by Performance Prediction. In: AAAI, AAAI Press, Menlo Park (1998)
Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas algorithms. Information Processing Letters (1993)
Marić, F.: Formalization and Implementation of SAT Solvers. Journal of Automated Reasoning (submitted, 2008)
Marić, F.: Flexible Implementation of SAT solvers. In: SAT 2009, (submitted, 2009)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of the 38th Design Automation Conference, DAC 2001 (2001)
Nudelman, E., Leyton-Brown, K., Hoos, H.H., Devkar, A., Shoham, Y.: Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 438–452. Springer, Heidelberg (2004)
Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T). J. of the ACM (2006)
Pipatsrisawat, K., Darwiche, A.: A Lightweight Component Caching Scheme for Satisfiability Solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 294–299. Springer, Heidelberg (2007)
Samulowitz, H., Memisevic, R.: Learning to Solve QBF. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, AAAI Press, Menlo Park (2007)
Smith-Miles, K.: Cross-Disciplinary Perspectives on Meta-Learning for Algorithm Selection. ACM Comput. Surv. (2008)
Tomovic, A., Janicic, P., Keselj, V.: n-Gram-Based Classification and Unsupervised Hierarchical Clustering of Genome Sequences. Computer Methods and Programs in Biomedicine (2006)
Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: The Design and Analysis of an Algorithm Portfolio for SAT. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 712–727. Springer, Heidelberg (2007)
Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: Portfolio-based Algorithm Selection for SAT. Journal of Artificial Intelligence Research (2008)
Xu, Y., Stern, D., Samulowitz, H.: Learning Adaptation to Solve Constraint Satisfaction Problems. In: LION 3 (2009)
Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In: International Conference on Computer Aided Design (ICCAD) (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nikolić, M., Marić, F., Janičić, P. (2009). Instance-Based Selection of Policies for SAT Solvers. In: Kullmann, O. (eds) Theory and Applications of Satisfiability Testing - SAT 2009. SAT 2009. Lecture Notes in Computer Science, vol 5584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02777-2_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-02777-2_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02776-5
Online ISBN: 978-3-642-02777-2
eBook Packages: Computer ScienceComputer Science (R0)