Parallel resolution of the satisfiability problem (SAT) with OpenMP and MPI

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

Volumn 3911 LNCS, Issue , 2006, Pages 380-388

  Singer, Daniel ^a   Vagner, Alain ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; DECOMPOSITION; INFORMATION DISSEMINATION; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

PARALLEL RESOLUTION; SAT SOLVERS; SATISFIABILITY (SAT); WORKLOAD BALANCING;

COMPUTATIONAL METHODS;

EID: 33745801597     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11752578_46     Document Type: Conference Paper

References (32)

1. H. Bennaceur, The satisfiability problem regarded as a constraint satisfaction problem, In Proc. of ECAI'96, pp.155-159, 1996.
2. M. Böehm, E. Speckeumeyer, A fast Parallel Sat Solver - efficient work load balancing, In Third Int. Symp. on AI and Maths. AIMSA, Fort Lauderdale, Florida USA, 1994.
3. W. Blochinger, C. Sinz, W. Kchlin, PaSAT-Parallel SAT-Checking with Lemma Exchange: Implementation and Applications, In Proc. of SAT'2001[21], 2001.
4. W. Blochinger, C. Sinz, W. Kchlin, Parallel propositional satisfiability checking with distributed dynamic learning. Parallel Computing, 29(7):969-994, 2003.
5. S. A. Cook, D. G. Mitchell, Finding Hard Instance of the Satisfiability Problem: a survey, In DIMACS Series in Discrete Maths. and TCS., AMS, Vol.35, pp.1-17, 1997.
6. W. Chrabakh, R. Wolski, GridSAT: a Chaff-based Distributed SAT Solver for the Grid, Super Computing Conference, SC'2003, Phoenix Arizona, USA 2003.
7. W. Chrabakh, R. Wolski, Solving "hard" stisfiability problems using GridSAT, 2004. (http::www.cs.ucsb.edu/~chrabakh/papers/gridsat-hp.pdf)
8. M. Cope, I. Gent, K. Hammond, Parallel Heuristic Search in Haskell, In Trends in Functional Programming, Vol.2, pp.65-73, S. Gilmore ed., Intellect Books, Bristol, UK, 2000.
9. M. Davis, G. Logeman, D. Loveland, A machine program for Theorem Proving, CACM, Vol.5 (7), 1962.
10. Y. Feldman, N. Derschowitz, Z. Hanna, Parallel Multithreaded Satisfiability Solver: Design and Implementation. PDMC 2004, 2004.
11. R. Génisson, P. Jégou, Davis-Putnam were already checking forward, In Proc. of ECAI'96, pp.180-184, 1996.
12. I. Gent, H, van Maaren, T. Walsh eds., SAT 2000, Highlights of Satisfiability Research in the Year 2000, Frontiers in AI and Applications, Vol. 63, Kluwer AC. Publ., 2000.
13. J. Gu, P.W. Purdom, J. Franco, B.W. Wah, Algorithms for Satisfiability (SAT) problem: a Survey, In DIMACS Series in Dicrete Maths. and TCS., AMS, Vol.35, pp. 19-152, 1996.
14. Z. Habbas, M. Krajecki, D. Singer, Parallel resolution of CSP with OpenMP. In Proc. of the second European Workshop on OpenMP, EWOMP'00, Edinburgh, Scotland, pp. 1-8, 2000.
15. Z. Habbas, M. Krajecki, D. Singer, Shared memory implementation of CSP resolution. In Proc. of HLPP'2001, Orléans, France, 2001.
16. Z. Habbas, M. Krajecki, D. Singer, The Langford's Problem: a Challenge for Parallel Resolution of CSP, In Proc. of PPAM'2001, LNCS Vol. 2328, Naleczow, Poland, 2001.
17. Z. Habbas, M. Krajecki, D. Singer, Parallelizing Combinatorial Search in Shared Memory, In Proc. of the third European Workshop on OpenMP, EWOMP'02, Roma, Italy, 2002.
18. Z. Habbas, M. Krajecki, D. Singer, Decomposition Techniques for Parallel Resolution of Constraint Satisfaction Problems in Shared Memory: a Comparative Study. Special issue of ICPP-HPSECA01, Int. Jour, of Computational Science and Engineering (IJCSE), to be published, 2005.
19. B. Jurkowiak, C.M. Li, G. Utard, Parallelizing Satz Using Dynamic Workload Balancing. In Proc. of SAT'2001[21], 2001.
20. B. Jurkowiak, Programmation Haute Performance pour la Résolution des problèmes SAT et CSP, Thèse de l'Université de Picardie, Amiens, 2004.
21. H. Kautz, B. Selman: Proc. of the Workshop on Theory and Applications of Satisfiability Testing, (SAT'2001), Elsevier Science Publishers, Electronic Notes in Discrete Mathematics Vol.9. 2001. http://www.elsevier.nl/gej-ng/31/29/ 24/42/show/Products/notes/cover.htt
22. C. M. Li, Anbulagan, Heuristics based on unit propagation for satisfiability problems. In 15th Int. Joint Conference on AI, IJCAI'97, Morgan Kaufmann Pub., Nagoya Japon, pp.366-371, 1997.
23. F. Massacci, L. Marraro, Logical cryptanalysis as a SAT-problem: Encoding and analysis of the U.S. Data Encryption Standard, Journal of Automated Reasoning, Vol.24(1-2), pp.165-203, 2000, (http://www.dis.uniromal.it/massacci/ papers/).
24. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: Engineering an Efficient SAT Solver, Proc. of the 39th. DAC, Las Vegas USA, 2001.
25. OpenMP Architecture Review Board, OpenMP C and C++ Application Program Interface, http://www.openmp.org.
26. SATLIB : http://www.intellektik.informatik.tu-darmstadt.de/SATLIB/.
27. SATLive: http://www.satlive.org.
28. D. Singer, Parallel Resolution of the Satisfiability Problem: a Survey, In Parallel Combinatorial Optimization, El-Ghazali Talbi ed., Wiley and Sons, to appear.
29. M. Snir, S.W. Otto, S. Huss-Lederman, D.W. Walker, J. Dongarra, MPI: the complete reference, the MIT Press, 1996.
30. T. Walsh, SAT versus CSP, Proc. CP'2000, LNCS 1894, pp. 441-456, Springer, 2000.
31. H. Zang, M.P. Bonacina, J. Hsiang, PSATO: a distributed propositional prover and its applications to Quasigroup problems, Journal of Symbolic Computation, Vol.21, pp.543-560, 1996.
32. L. Zang, S. Malik Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms, Proc. of SAT'2003, 2003.