A distribution method for solving SAT in grids

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

Volumn 4121 LNCS, Issue , 2006, Pages 430-435

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

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; OPTIMIZATION;

COMPUTATIONAL GRID INFRASTRUCTURE; DISTRIBUTED COMPUTATIONS; DISTRIBUTION HEURISTICS; GRID ENVIRONMENTS;

PROBLEM SOLVING;

EID: 33749540946     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_39     Document Type: Conference Paper

References (18)

1. Kautz, H., Selman, B.: Pushing the envelope: Planning, propositional logic, and stochastic search. In: AAAI/IAAI 1996, AAAI Press (1996) 1194-1201
2. Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods in System Design 19(1) (2001) 7-34
3. Zhang, H., Bonacina, M., Hsiang, J.: PSATO: A distributed propositional prover and its application to quasigroup problems. J. Symbolic Computation 21(4) (1996) 543-560
4. Chrabakh, W., Wolski, R.: GridSAT: A chaff-based distributed SAT solver for the grid. In: SC 2003, IEEE (2003)
5. 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) (2005) 73-101
6. Sinz, C., Blochinger, W., Küchlin, W.: PaSAT -Parallel SAT-checking with lemma exchange: Implementation and applications. In: SAT 2001. Volume 9 of Electronic Notes in Discrete Mathematics., Elsevier (2001) 12-13
7. Blochinger, W., Sinz, C., Küchlin, W.: Parallel propositional satisfiability checking with distributed dynamic learning. J. Parallel Computing 29(7) (2003) 969-994
8. Forman, S., Segre, A.: NAGSAT: A randomized, complete, parallel solver for 3-SAT. In: SAT 2002. (2002) Online proceedings at http://gauss.ececs.uc.edu/ Conferences/SAT2002/sat20021ist.html.
9. Boehm, M., Speckenmeyer, E.: A fast parallel SAT-solver: Efficient workload balancing. Annals of Mathematics and Artificial Intelligence 17(4-3) (1996) 381-400
10. Okushi, F.: Parallel cooperative propositional theorem proving. Annals of Mathematics and Artificial Intelligence 26(1-4) (1999) 59-85
11. Speckenmeyer, E., Boehm, M., Heusch, P.: On the imbalance of distributions of solutions of CNF-formulas and its impact on satisfiability solvers. In: Satisfiability Problem: Theory and Applications, DIMACS (1997) 669-676
12. Blochinger, W., Westje, W., Küchlin, W., Wedeniwski, S.: ZetaSAT - Boolean satisfiability solving on desktop grids. In: CCGrid 2005, IEEE (2005) 1079-1086
13. 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) (2000) 67-100
14. Gomes, C.P., Selman, B.: Algorithm portfolios. Artificial Intelligence 126(1-2) (2001) 43-62
15. Eerola, P., et al.: Building a production grid in Scandinavia. IEEE Internet Computing 7(4) (2003) 27-35
16. Zhang, L.: SAT-solving: From Davis-Putnam to Zchaff and beyond, lecture notes (2003) Available online at http://research.microsoft.com/users/lintaoz/ SATSolving/satsolving.htm.
17. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: DAC 2001, ACM (2001) 530-535
18. Hyvärinen, A.E.J.: SATU: A system for distributed propositional satisfiability checking in computational grids. Research Report A100, Helsinki Univ. of Technology, Lab. for Theoretical Comp. Science, Espoo, Finland (2006)