Instance-based selection of policies for SAT solvers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5584 LNCS, Issue , 2009, Pages 326-340

  Nikolić, Mladen ^a   Marić, Filip ^a   Janičić, Predrag ^a  

^a UNIVERSITY OF BELGRADE   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

EVALUATION RESULTS; HEURISTIC POLICIES; SAT SOLVERS; SAT-SOLVING; SEARCH PROCESS;

HEURISTIC METHODS;

EID: 70350675971     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02777-2_31     Document Type: Conference Paper

References (24)

1. Biere, A.: PicoSAT Essentials. Journal on Satisfiability, Boolean Modeling, and Computation (2008)
2. 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)
3. Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem-Proving. Commun. ACM (1962)
4. Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. J. ACM (1960)
5. Eeń, N., Sörensson, N.: An Extensible SAT-solver. In: Theory and Applications of Satisfiability Testing (2004)
6. Gomes, P., Kautz, H., Sabharwal, A., Selman, B.: Satisfiability Solvers. In: Handbook of Knowledge Representation, Elsevier, Amsterdam (2007)
7. 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)
8. Krstíc, 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)
9. Kibria, R.H.: Evolving a Neural Net-Based Decision and Search Heuristic for DPLL SAT Solvers. In: IJCNN (2007)
10. Lobjois, L., Lemaitre, M.: Branch and Bound Algorithm Selection by Performance Prediction. In: AAAI, AAAI Press, Menlo Park (1998)
11. Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas algorithms. Information Processing Letters (1993)
12. Maríc, F.: Formalization and Implementation of SAT Solvers. Journal of Automated Reasoning (submitted, 2008)
13. Maríc, F.: Flexible Implementation of SAT solvers. In: SAT 2009, (submitted, 2009)
14. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Effcient SAT Solver. In: Proceedings of the 38th Design Automation Conference, DAC 2001 (2001)
15. 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)
16. 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)
17. 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)
18. Samulowitz, H., Memisevic, R.: Learning to Solve QBF. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, AAAI Press, Menlo Park (2007)
19. Smith-Miles, K.: Cross-Disciplinary Perspectives on Meta-Learning for Algorithm Selection. ACM Comput. Surv. (2008)
20. Tomovic, A., Janicic, P., Keselj, V.: n-Gram-Based Classification and Unsupervised Hierarchical Clustering of Genome Sequences. Computer Methods and Programs in Biomedicine (2006)
21. 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)
22. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: Portfolio based Algorithm Selection for SAT. Journal of Artificial Intelligence Research (2008)
23. Xu, Y., Stern, D., Samulowitz, H.: Learning Adaptation to Solve Constraint Satisfaction Problems. In: LION 3 (2009)
24. Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Effcient Conflict Driven Learning in a Boolean Satisfiability Solver. In: International Conference on Computer Aided Design (ICCAD) (2001)