Parallelizing local search for CNF satisfiability using vectorization and PVM

ACM Journal of Experimental Algorithmics

Volumn 7, Issue , 2002, Pages

  Iwama, Kazuo ^a   Kawai, Daisuke ^a   Miyazaki, Shuichi ^a   Okabe, Yasuo ^a   Umemoto, Jun ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

Algorithms; CNF satisfiability; D.1.3 programming techniques : concurrent programming distributed programming, parallel programming; Distributed computing; Experimentation; G.2.1 discrete mathematics : combinatorics combinatorial algorithms; Local search algorithms; Parallelization; PVM; Vector supercomputer; Vectorization

Indexed keywords

EID: 84889613437     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/944618.944620     Document Type: Article

References (32)

1. Asahiro, Y., Iwama, K. and Miyano, E., "Random Generation of Test Instances with Controlled Attributes," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.377-393, 1996.
2. Cha, B. and Iwama, K., "Performance test of local search algorithms using new types of random CNF formulas," Proc. IJCAI-95, pp.304-310, 1995.
3. Cha, B. and Iwama, K., "Adding new clauses for faster local search," Proc. AAAI-96, pp.332-337, 1996.
4. Cha, B., Iwama, K., Kambayashi, Y. and Miyazaki, S., "Local search algorithms for Partial MAXSAT," Proc. AAAI-97, pp.263-268, 1997.
5. Cheeseman, P., Kanefsky, B. and Taylor W.M., "Where the really hard problems are," Proc. IJCAI-91, pp.331-337, 1991.
6. Data Processing Center, Kyoto University. Vector Parallel Supercomputer VPP800/63, http://www.kudpc.kyoto-u.ac.jp/Supercomputer/
7. Dubois, O., Andre, P., Boufkhad, Y. and Carlier, J. "SAT versus UNSAT," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.415-436, 1996.
8. Geist, A., Berguelin, A., Dongarra, J., Jiang, W., Manchek, R. and Sunderam, V., Parallel Virtual Machine, The MIT Press, 1994.
9. Gelder, A.V. and Tsuji, Y.K. "Satisfiability testing with more reasoning and less guessing,"DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.5590-586, 1996.
10. Gent, I., and Walsh, T., "Unsatisfied variables in local search," Hybrid Problems, Hybrid Solutions (AISB-95), Amsterdam, 1995.
11. Gu, J. "Efficient local search for very large-scale satisfiability problems," Sigart Bulletin, Vol.3, No.1, pp.8-12, 1992.
12. Hampson, S. and Kibler, D. "Large plateaus and plateau search in boolean satisfiability problems: When to give up searching and start again," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.437-455, 1996.
13. Hiraishi, H., Hamaguchi, K., Ochi, H. and Yajima, S., "Vectorized Symbolic Model Checking of Computation Tree Logic for Sequential Machine Verification," Proc. CAV'91 (LNCS 575), pp.214-224, 1991.
14. Johnson, D. S. and Trick, M. A. Eds. "Cliques, Coloring, and Satisfiability," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, 1996.
15. Jaumard, B., Stan, M. and Desrosiers, J., "Tabu search and a quadratic relaxation for satisfiability problem," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.457-478, 1996.
16. Koutsoupias, E. and Papadimitriou, C.H., "On the greedy algorithm for satisfiability," Information Processing Letters, Vol. 43, pp.53-55, 1992.
17. Mitchell, D., Selman, B. and Levesque, H., "Hard and easy distributions of SAT problems,"Proc. AAAI-92, pp.459-465, 1992.
18. Miyazaki, S., Iwama, K. and Kambayashi, Y., "Database queries as combinatorial optimization problems," Proc. CODAS'96, pp.448-454, 1996.
19. Morris, P., "The breakout method for escaping from local minima," Proc. AAAI-93, pp.40- 45, 1993.
20. Nonobe, K. and Ibaraki, T., "A tabu search approach for the constraint satisfaction problem as a general problem solver," European Journal of Operational Research, 106, pp. 599-623, 1998.
21. Papadimitriou, C.H., "On selecting a satisfying truth assignment," Proc. FOCS'91, pp.163- 169, 1991.
22. Pretolani, D., "Efficiency and sability of hypergraph SAT algorithms," in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.479-498, 1996.
23. Resende, M.G.C. and Feo, T.A., " A GRASP for satisfiability," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.499-520, 1996.
24. Schoning, U, "A probabilistic algorithm for k-SAT and constraint satisfaction problems,"Proc. FOCS'99, pp.410-414, 1999.
25. Selman, B. and Kautz, H., GSAT USER'S GUIDE Version 35, http://www.satlib.org/solvers.html.
26. Selman, B. and Kautz, H., "An empirical study of greedy local search for satisfiability testing,"Proc. AAAI-93, pp.46-51, 1993.
27. nd DIMACS Challenge Workshop, 1993.
28. Selman, B., Kautz, H. and McAllester, D., "Ten challenges in propositional reasoning and search," Proc. IJCAI-97, pp.50-54, 1997.
29. Selman, B., Levesque, H.J. and Mitchell, D.G., "A new method for solving hard satisfiability problems," Proc. AAAI-92, pp.440-446, 1992.
30. Selman, B., Kautz, H. and Cohen, B., "Local Search Strategies for Satisfiability Testing,"DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.521-531, 1996.
31. Spears, W.M. "Simulated annealing for hard satisfiability problems," DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 26, American Mathematical Society, pp.533-557, 1996.
32. Watanabe Lab, Dept. of Comp. Science, Tokyo Institute of Technology. Random Generation of Unique Solution 3SAT Instances, http://www.is.titech.ac.jp/-watanabe/gensat/a1/index.html