Parallelizing Satz using dynamic workload balancing

Electronic Notes in Discrete Mathematics

Volumn 9, Issue , 2001, Pages 174-189

  Jurkowiak, Bernard ^a   Li, Chu Min ^a   Utard, Gil ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

Parallel Search Algorithms; Parallelization of DPLL procedure; SAT

Indexed keywords

EID: 16244377001     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00321-X     Document Type: Article

References (24)

1. R.J. Bayardo and R.C. Schrag. Using CSP Look-Back Techniques to Solve Real-World SAT Instances. In proceedings AAAI'97, pages 203-208, 1997.
2. R. Béjar and F. Manya. Solving the round robin problem using propositional logic. In Proceedings of AAAI'2000, pages 262-266, Austin, Texas, 2000.
3. M. Boehm and E. Speckenmeyer. A fast parallel SAT-solver - efficient workload balancing. In Third International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdate, Florida, 1994.
4. S.A. Cook. The Complexity of Theorem Proving Procedures. In 3rd ACM Symp. on Theory of Computing, pages 151-158, 1971.
5. J.M. Crawford and L.D. Auton. Experimental Results on the Crossover Point in random 3-SAT. Artificial Intelligence, 81, 1996.
6. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communication of ACM, pages 394-397, 1962.
7. O. Dubois, P. Andre, Y. Boufkhad, and J. Carlier. SAT versus UNSAT. Second DIMACS Challenge: Cliques, Coloring and Satisfiability. In Rutgers University, NJ, 1993.
8. J.W. Freeman. Improvement to Propositional Satisfiability Search Algorithms. Ph.d. thesis, Univ. of Pennsylvania, Philadelphia, 1995.
9. I. Gent and T. Walsh. Towards an understanding of hill-climbing procedures for SAT. In proceedings AAAI-93, 1993.
10. C Germain, V. Néri, G. Fedak, and F. Cappello. Xtremweb: building an experimental platform for Global Computing. In Grid2000, 2000.
11. Y. Grama and V. Kumar. A Survey of Parallel Search Algorithms for Discrete Optimization Problems. University of Minnesota (1992).
12. http://www.intellektik.informatik.tu-darmstadt.de/satlib.
13. H. Kautz and B. Selman. Pushing the envelope : Planing, propositional logic, and stochastic search. In Proceedings of AAAI'96, Portland, Oregon, 4-8 August 1996.
14. C.M. Li. A constraint-based approach to narrow search trees for satisfiability. Information Processing Letters, 71:75-80, 1999.
15. C.M. Li and Anbulagan. Heuristic based on unit propagation for satisfiability problems. In Proceedings IJCAI'97, pages 366-371, Nagoya, Japan, August 1997.
16. J.P. Marques Silva and K.A. Sakallah. Conflict Analysis in Search Algorithms for Propositionnal Satisfiability. In International Conference on Tools with Artificial Intelligence, 1996.
17. B. Mazure, L. Saïs, and É. Grégoire. Tabu Search for SAT. In proceedings AAAI'97, 1997.
18. D. Mitchell, B. Selman, and H. Levesque. Hard and Easy Distributions of SAT Problems. In proceedings AAAI'92, pages 459-465, San Jose, CA, 1992.
19. B. Selman, H. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings AAAI-94, 1994.
20. B. Selman, H. Kautz, and D. McAllester. Ten Challenges in Propositional Reasoning and Search. In proceedings IJCAI-97, pages 50-54, 1997.
21. B. Selman, D. Mitchell, and H. Levesque. A new Method for Solving Hard Satisfiability Problems. In proceedings AAAI'92, pages 440-446, 1992.
22. G.S. Tseitin. On the complexity of derivation in propositional calculus. In A. O. Slisenko, ed. Studies in constructive mathematics and mathematical logic, Part II (translated from Russian), pages 115-125, Consultants Bureau, New York, 1970.
23. H. Zhang. An efficient propositional prover. In proceedings of int'Conf. on Automated Deduction, pages 272-275, 1997.
24. H. Zhang, M.P. Bonacina, and J. Hsiang. PSATO: a Distributed Propositional Prover and Its Applications to Quasigroup Problems. J. Symbolic Computation, 1996.