Incorporating learning in grid-based randomized SAT solving

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

Volumn 5253 LNAI, Issue , 2008, Pages 247-261

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

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CLAUSE LEARNING; COMPUTATIONAL GRIDS; DISTRIBUTED COMPUTING ENVIRONMENT; DISTRIBUTED FRAMEWORKS; GRID ENVIRONMENTS; INTERNATIONAL CONFERENCES; PARALLEL LEARNING; PRODUCTION LEVELS; RUN-TIME; SAT INSTANCES; SAT SOLVERS; SAT SOLVING; SPEED-UPS;

ARTIFICIAL INTELLIGENCE; BENCHMARKING; COMPUTER SYSTEMS; CYBERNETICS; EDUCATION; KNOWLEDGE BASED SYSTEMS; LEARNING ALGORITHMS; PARALLEL ALGORITHMS;

BOOLEAN FUNCTIONS;

EID: 52149106240     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85776-1_21     Document Type: Conference Paper

References (21)

1. Boehm, M., Speckenmeyer, E.: A fast parallel SAT-solver: Efficient workload balancing. Annals of Mathematics and Artificial Intelligence 17(4-3), 381-400 (1996)
2. Zhang, H., Bonacina, M., Hsiang, J.: PSATO: A distributed propositional prover and its application to quasigroup problems. Journal of Symbolic Computation 21(4), 543-560 (1996)
3. 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)
4. Feldman, Y., Dershowitz, N., Hanna, Z.: Parallel multithreaded satisfiability solver: Design and implementation. Electronic Notes in Theoretical Computer Science 128(3), 75-90 (2005)
5. 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)
6. Schubert, T., Lewis, M., Becker, B.: PaMira - a parallel SAT solver with knowledge sharing. In: MVT 2005, pp. 29-36. IEEE Computer Society Press, Los Alamitos (2005)
7. Hyvärinen, A.E.J., Junttila, T., Niemelä, I.: Strategies for solving SAT in grids by randomized search. In: 9th International Conference on Artificial Intelligence and Symbolic Computation (AISC 2008) (accepted for publication, 2008)
8. 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, Heidelberg (2006)
9. Forman, S., Segre, A.: NAGSAT: A randomized, complete, parallel solver for 3-SAT. In: SAT (2002), http://gauss.ececs.uc.edu/Conferences/SAT2002/ sat2002list.html
10. Blochinger, W., Westje, W., Küchlin, W., Wedeniwski, S.: ZetaSAT - Boolean satisfiability solving on desktop grids. In: CCGrid 2005, pp. 1079-1086. IEEE, Los Alamitos (2005)
11. Chrabakh, W., Wolski, R.: GridSAT: A chaff-based distributed SAT solver for the grid. In: SC 2003. IEEE, Los Alamitos (2003)
12. Inoue, K., Soh, T., Ueda, S., Sasaura, Y., Banbara, M., Tamura, N.: A competitive and cooperative approach to propositional satisfiability. Discrete Applied Mathematics 154(16), 2291- 2306 (2006)
13. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: DAC 2001, pp. 530-535. ACM Press, New York (2001)
14. 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)
15. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7(3), 201-215 (1960)
16. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5(7), 394-397 (1962)
17. Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers 48(5), 506-521 (1999)
18. Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: ICCAD 2001, pp. 279-285. ACM Press, New York (2001)
19. Gomes, C.P., Selman, B., Crato, N., Kautz, H.A.: Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 24(1/2), 67-100 (2000)
20. Haanpää, H., Järvisalo, M., Kaski, P., Niemelä, I.: Hard satisfiable clause sets for benchmarking equivalence reasoning techniques. Journal on Satisfiability, Boolean Modeling and Computation 2, 27-64 (2006)
21. Hyvärinen, A.E.J.: GridJM. A Computer Program, http://www.tcs.hut. fi/∼aehyvari/gridjm/