Parallel Resolution of the Satisfiability Problem: A Survey

Parallel Combinatorial Optimization

Volumn , Issue , 2006, Pages 123-147

  Singer, Daniel ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

longmult family and BMC (Bounded Model Checking) domain; Parallel resolution of SAT; Satisfiability problem (SAT)

Indexed keywords

EID: 45449100485     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470053928.ch5     Document Type: Chapter

References (74)

1. J. Gu, P.W. Purdom, J. Franco, and B.W. Wah, Algorithms for Satisfiability (SAT) problem: a survey, DIMACS Ser Dicrete Math. TCS., AMS, 35, 19-152 (1996).
2. J. Gu, Parallel algorithms for Satisfiability problem, DIMACS Series in Dicrete Maths. TCS., AMS, 22, 105 (1995).
3. T. Stützle, H. Hoos, and A. Roli, A review of the literature on local search algorithms for MAX-SAT, TR. AIDA.01.02, Darmstadt University of Technology, 2001.
4. D. Mitchell, B. Selman, and H. Leveque, A new method for solving hard satisfiability problems, Proceeding of 10th National Conference on AI, AAAI 1992, MIT Press, San Jose, CA 1992, pp. 440-446.
5. D. McAllester, B. Selman, and A. Kautz, Evidence for invariant in local search, Proceeding of 14th. National Conference on AI, AAAI 1997, MIT Press, Cambridge 1997, pp. 321-326.
6. A. Roli, Criticality and parallelism in GSAT, Proc. SAT'2001, (27) (2001).
7. K. Iwama, D. Kawai, S. Miyazaki, Y. Okabe, and J. Umemoto, Parallelizing local search for cnf satisfiability using vectorization and pvm, ACM J. Exp. Algorithms, 7(2) (2002).
8. M. Davis, G. Logeman, and D. Loveland, A machine program for Theorem Proving, CACM, 5(7) (1962).
9. H. Bennaceur, The Satisfiability problem regarded as a constraint satisfaction problem, Proc. ECAI'96, 155-159 (1996).
10. R. Génisson and P. Jégou, Davis-Putnam were already checking forward, Proc. ECAI'96, 180-184 (1996).
11. T. Walsh, SAT versus CSP, Proc. of CP'2000, LNCS 1894, 441-456 (2000).
12. Z. Habbas, M. Krajecki, and D. Singer, Parallel resolution of CSP with OpenMP. Proceedings of the Second European Workshop on OpenMP, EWOMP'00, 1-8, Edinburgh, Scotland, 2000.
13. Z. Habbas, M. Krajecki, and D. Singer, Shared memory implementation of CSP resolution. Proceedings of HLPP'2001, Orléans, France, 2001.
14. Z. Habbas, M. Krajecki, and D. Singer, Decomposition techniques for parallel resolution of Constraint Satisfaction Problems in shared memory: a comparative study. Special issue of ICPP-HPSECA01, Int. J. Comput. Sci. Eng. (IJCSE), 1(2134):192-206 (2005).
15. E. Amir and S. McIlraith, Solving Satisfiability using decomposition and the most constrained subproblem, Proc. SAT'2001 (27) (2001).
16. E. Amir and S. McIlraith, Partition-based logical reasoning for first Oder and propositional theories, Art. Intel. J. (2004).
17. P. Bjesse, J. Kukula, R. Damiano, T. Stanion, and Y. Zhu, Guiding SAT diagnosis with tree decompositions, Proc. SAT'2003 (2003).
18. A. Darwiche, Compiling knowledge into decomposable negation normal form, Proc. 15th. IJCAI, 284-289 (1999).
19. S.A. Cook and D.G. Mitchell, Finding hard instance of the Satisfiability problem: a survey, DIMACS Ser Dicrete Maths. TCS., AMS, 35, 1-17 (1997).
20. SATLIB-The Satisfiability Library. Available at http://www.intellektik.informatik.tu-darmstadt.de/SATLIB/.
21. Available at SATLive: http://www.satlive.org.
22. D. Leberre and L. Simon, Fifty-five solvers in Vancouver: the SAT'2004 competition, Proceedings of SAT'2004, LNCS 3542, 2005.
23. G. Dequen and O. Dubois, kcnfs: an efficient solver for random k-SAT formulae, Proc. SAT'2003, LNCS 2919, 486-501 (2003).
24. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, Determining computational complexity from characteristic "phase transitions", Nature (London), 400, 133-137 (1999).
25. G. Dequen and O. Dubois, A backbone-search heuristic for efficient solving of hard random 3-SAT formulae, Proc. 17th. IJCAI, 248-253 (2001).
26. I. Gent, H. van Maaren, and T. Walsh, eds., SAT 2000, Highlights of Satisfiability research in the year 2000, Frontiers in AI and Applications, Vol. 63, Kluwer Academic Publishers Amsterdam, 2000.
27. H. Kautz and B. Selman: Proceedings of the Workshop on Theory and Applications of Satisfiability Testing, (SAT'2001), Elsevier Science Publishers, Electronic Notes in Discrete Mathematics Vol.9. 2001.
28. M. Böehm and E. Speckenmeyer, A fast parallel Sat solver-efficient work load balancing, Proceeding of the Third International Symposium on AI and Mathematics AIMSA, Fort Lauderdale, FL, 1994.
29. C.M. Li and Anbulagan, Heuristics based on unit propagation for satisfiability problems. Proceedings of 15th International Joint Conference on AI, IJCAI'97, Morgan Kaufmann Pub., Nagoya Japon, 1997, pp. 366.
30. M. Moskewicz et al. Chaff: Engineering an efficient SAT solver, Proceedings of the 39th DAC, Las Vegas, 2001.
31. J.P. Marques-Silva and K.A. Sakallah, GRASP-A new search algorithm for Satisfiability, Proc. ICCAD'96, 220-227 (1996).
32. H. Zang, SATO: An efficient propositional prover, Proceedings of International Conference on Automated Deduction, CADE-97, 1997.
33. E. Goldberg and Y. Novikov, BerkMin: a fast and robust SAT-solver, Proc. Design, Automation Test Eur. (DATE'02), 142-149 (2002).
34. L. Zang and S. Malik Cache performance of SAT solvers: a case study for efficient implementation of algorithms, Proceedings of SAT'2003, 2003.
35. J.P. Marques-Silva and K.A. Sakallah, Conflict analysis in search algorithms for propositional Satisfiability, Proceeding of the IEEE. ICTAI, 1996.
36. R. Bayardo, Jr. and R. Schrag, Using CSP look-back techniques to solve real-world SAT instances, Proc. CP'96, LNCS 1118, 46-60 (1996).
37. C. Thiffault, F. Bacchus, and T. Walsh, Solving non-clausal formulas with DPLL search, Proc. SAT'2004, LNCS 3542 (2005).
38. P. Jackson and D. Sheridan, The optimality of a fast CNF conversion and its use with SAT, Proc. SAT'2004, LNCS 3542, 2005.
39. H. Kautz, SATPLAN04: Planning as Satisfiability. Available at http://www.cs.washington.edu/homes/kautz/satplan/.
40. P. Baumgartner and F. Massacci, The taming of the (X)OR, Proc. Computational Logic-CL 2000, LNAI 1861, 508-522 (2000).
41. C.M. Li, Integrating equivalency reasoning into Davis-Putnam procedure. Proceedings of AAAI-2000, Austin, TX 2000, pp. 291-296.
42. M. Heule and H. van Maaren, Aligning CNF and equivalence reasoning, Proc. SAT'2004, LNCS 3542, 145-156 (2005).
43. P.M. Pardalos, L.S. Pitsoulis, and M.G.C. Resende, A parallel GRASP for MAXSAT problems, Proc. PARA'96, LNCS 1180, 575-585 (1996).
44. D. Leberre, Exploiting the real power of unit propagation lookahed, Proc. SAT'2001 (27) (2001).
45. F. Okushi, Parallel cooperative propositional theorem proving, Proceedings of the 5th. International Symposium on AI and Maths. AIMSA, Fort Lauderdale, FL, 1998.
46. L.C. Wu and C.Y. Tang, Solving the satisfiability problem by using randomized approach, Inf. Proc. Lett., 41, 187-190 (1992).
47. R.M. Karp and Y. Zhang, Randomized parallel algorithms for Backtrack search and Branch-and-Bound computation, J. ACM., 40(3):765-789 (1993).
48. Y. Zhang and A. Ortynski, Efficiency of randomized parrallel Backtrack search, Algorithmica, 24, 14-28 (1999).
49. T. Hogg and C.P. Williams, Expected gains from parallelizing constraint solving for hard problems, Proc. AAAI'94, 331-336 (1994).
50. S. Forman and A. Segre, NAGSAT: a randomized complete, parallel solver for 3-SAT, Proc. SAT'2002, 236-243 (2002).
51. B. Monien and E. Speckenmeyer, Solving Satisfiability in less than 2n steps, Discrete Appl. Maths., 10, 287-295 (1985).
52. E. Speckenmeyer, B. Monien, and O. Vornberger, Superlinear speedup for Parallel Backtracking, Proc. SuperComput. Conf. 87, LNCS 297, 985-995 (1987).
53. O. Kullmann, Investigations on autark assignments, Disc. App. Math., 107:99-137 (2000).
54. H. Zang and M.P. Bonacina, Cumulating search in a distributed computing environment: a case study in parallel satisfiability, Proceedings of PASCO'94, 1994.
55. H. Zang, M.P. Bonacina, and J. Hsiang, PSATO: a distributed propositional prover and its applications to Quasigroup problems, J. Symbolic Comput., 21, 543-560 (1996).
56. B. Jurkowiak, C.M. Li, and G. Utard, Parallelizing Satz using dynamic workload balancing. Proc. SAT'2001 (27) (2001).
57. B. Jurkowiak, Programmation haute performance pour la résolution des problèmes SAT et CSP, Thèse de l'Université de Picardie, Amiens, 2004.
58. W. Blochinger, C. Sinz, and W. Kchlin, PaSAT-Parallel SAT-checking with lemma exchange: implementation and applications, Proc. SAT'2001 (27) (2001).
59. W. Blochinger, C. Sinz, and W. Kchlin, Parallel propositional satisfiability checking with distributed dynamic learning. Parallel Comput, 29(7):969-994 (2003).
60. Y. Feldman, N. Derschowitz, and Z. Hanna, Parallel multithreaded Satisfiability solver: design and implementation. Proc. PDMC 2004 (2004). ENTCS, 123(3):75-79 (2005).
61. E. Speckenmeyer, M. Böhm, and P. Heusch, On the imbalance of distributions of solutions of CNF-formulas and its impact on Satisfiability solvers, DIMACS Ser Dicrete Maths. TCS., AMS, 35, 669-676 (1996).
62. W. Chrabakh and R. Wolski, GrADSAT: a parallel SAT solver for the Grid, TR.2003-05, CS. University of California, Santa Barbara, 2003. Available at http//www.cs.ucsb.edu/research/trcs/docs/2003-05.pdf.
63. W. Chrabakh and R. Wolski, GridSAT: a Chaff-based distributed SAT Solver for the Grid, Proceedings of SuperComputing Conference, SC'2003, Phoenix, AR, 2003.
64. W. Chrabakh and R. Wolski, Solving "hard" satisfiability problems using GridSAT, 2004. Available at http//www.cs.ucsb.edu/~chrabakh/papers/gridsat-hp.pdf.
65. D. Kokotov and P Solver: distributed SAT solver framework. Available at http//sdg.lcs.mit.edu/satsolvers/PSolver/index.html.
66. M. Cope, I. Gent, and K. Hammond, Parallel heuristic search in Haskell, Trends in Functional Programming, Vol.2, S. Gilmore ed., Intellect Books, Bristol, UK, 2000, pp. 65-73.
67. T. Suyama, M. Yokoo, and H. Sawada, Solving Satifiability problems using logic synthesis and reconfigurable hardware, Proceeding of the 31th. Hawaian Internationnal Conference on System Sciences HICSS-31, 1998.
68. M. Platzner and G. De Micheli, Acceleration of Satifiability algorithms by reconfigurable hardware, Proc. 8th. Int. Workshop FPL'98, LNCS 1482, 69-78 (1998).
69. I. Skliarova and A.B. Ferrari, Reconfigurable hardware SAT solvers: a survey of systems, Proc. of Field-Programmable Logic and Applications (FPLA), P. Cheung, G. Constantinides, and J. de Sousa eds., LNCS 2778, 468-477 (2003).
70. D. Singer and A. Vagner, Parallel resolution of the Satisfiability problem (SAT) with OpenMP and MPI, Proc. PPAM 2005, LNCS. 3911, 380-388, Czeorochowa, Poland 2006.
71. OpenMP Architecture Review Board, OpenMP C and C++ Application Program Interface. Available at http://www.openmp.org.
72. M. Snir, S.W. Otto, S. Huss-Lederman, D.W. Walker, and J. Dongarra, MPI: the complete reference, MIT Press, Cambridge Massachusetts 1996.
73. C.M. Li and S. Gérard, On the Limit of Branching Rules for Hard Random Unsatisfiable 3-SAT. Proceeding of 14th Eur. Conference on AI, ECAI 2000, Berlin, 2000.
74. F. Massacci and L. Marraro, Logical cryptanalysis as a SAT-problem: Encoding and analysis of the U.S. Data Encryption Standard, J. Automated Reasoning, 24(1-2), 165-203 (2000).