Strategies for solving SAT in grids by randomized search

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

Volumn 5144 LNAI, Issue , 2008, Pages 125-140

  Hyvärinen, Antti E J ^a   Junttila, Tommi ^a   Niemelä, Ilkka ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

HARD INSTANCES; SAT SOLVER; SYMBOLIC COM-PUTATION;

ADMINISTRATIVE DATA PROCESSING; ARTIFICIAL INTELLIGENCE; CLASSIFICATION (OF INFORMATION); COMPUTER NETWORKS; EMBEDDED SYSTEMS; INFORMATION MANAGEMENT; KETONES; KNOWLEDGE MANAGEMENT; MANAGEMENT INFORMATION SYSTEMS;

GRID COMPUTING;

EID: 51049096835     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85110-3_11     Document Type: Conference Paper

References (24)

1. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
2. Gomes, C.P., Selman. B., Crato, N., Kautz, H.A.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. J. Automated Reasoning 24(1/2), 67-100 (2000)
3. Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Inf. Process. Lett. 47(4), 173-180 (1993)
4. Walsh, T.: Search in a small world. In: IJCAl, pp. 1172-1177. Morgan Kaufmann. San Francisco (1999)
5. Kautz, H.A., Horvitz. E., Ruan, Y., Gomes, C.R. Selman, B.: Dynamic restart policies. In: AAAI/IAAI, pp. 674-681 (2002)
6. Ruan, Y., Horvitz, E., Kautz, H.A.: Restart policies with dependence among runs: A dynamic programming approach. In: Van Hentenryck. P. (ed.) CP 2002. LNCS. vol. 2470, pp. 573-586. Springer. Heidelberg (2002)
7. Streeter, M., Golovin, D., Smith, S.F.: Restart schedules for ensembles of problem instances. In: AAAI. pp. 1204-1210. AAAI Press, Menlo Park (2007)
8. Huang, J.: The effect of restarts on the efficiency of clause learning. In: IJCAI, pp. 2318-2323 (2007)
9. Wu, H., van Beek, P.: On universal restart strategies for backtracking search. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741. Springer, Heidelberg (2007)
10. Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence 126(1-2), 43-62 (2001)
11. Wu, H., van Beek, P.: On portfolios for backtracking search in the presence of deadlines. In: ICTAI, pp. 231-238 (2007)
12. Inoue, K., et al.: A competitive and cooperative approach to prepositional satisfiability. Discrete Applied Mathematics 154(16), 2291-2306 (2006)
13. Luby, M., Ertel, W.: Optimal parallelization of Las Vegas algorithms. In: Enjalbert. P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 463-474. Springer, Heidelberg (1994)
14. Boehm, M., Speckenmeyer, E.: A fast parallel SAT-solver: Efficient workload balancing. Annals of Mathematics and Artificial Intelligence 17(4-3), 381-400 (1996)
15. Zhang, H., Bonacina, M., Hsiang, J.: PSATO: A distributed prepositional prover and its application to quasigroup problems. J. Symbolic Computation 21(4), 543-560 (1996)
16. Feldman. Y., Dershowitz, N., Hanna, Z.: Parallel multithreaded satisfiability solver: Design and implementation. Electronic Notes in Theoretical Computer Science 128(3), 75-90 (2005)
17. Blochinger, W., Westje, W., Ktichlin, W., Wedeniwski, S.: ZetaSAT - Boolean satisfiability solving on desktop grids. In: CCGrid 2005, pp. 1079-1086. IEEE, Los Alamitos (2005)
18. Jurkowiak. B., Li, C., Utard, G.: A parallelization scheme based on work stealing for a class of SAT solvers. Journal of Automated Reasoning 34(1), 73-101 (2005)
19. Sinz, C., Blochinger. W., Küchlin, W.: PaSAT -Parallel SAT-checking with lemma exchange: Implementation and applications. In: SAT 2001. Electronic Notes in Discrete Mathematics, vol. 9, pp. 12-13. Elsevier. Amsterdam (2001)
20. Chrabakh. W., Wolski, R.: GridSAT: A chaff-based distributed SAT solver for the grid. In: SC 2003. IEEE, Los Alamitos (2003)
21. Hyvärinen, A.E.J., Junttila, T., Niemelä, I.: A distribution method for solving SAT in grids. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS. vol. 4121, pp. 430-435. Springer, Hei-delberg (2006)
22. Forman, S., Segre, A.: NAGSAT: A randomized, complete, parallel solver for 3-SAT. In: SAT 2002. Proceedings (2002), http://gauss.ececs.uc.edu/ Conferenees/SAT2002/sat2002list.html
23. Pitkanen, M.J., et al.: Using the grid for enhancing the performance of a medical image search engine. In: CBMS 2008. IEEE. Los Alamitos (accepted for publication, 2008)
24. Hyvärinen, A.E.J. : GridJM a Computer Program, http://www.tes.hut. fi/~aehyvari/gridjm/