JaCk-SAT: A new parallel scheme to solve the satisfiability problem (SAT) based on join-and-check

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

Volumn 4967 LNCS, Issue , 2008, Pages 249-258

  Singer, Daniel ^a   Monnet, Anthony ^a  

^a UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; NEODYMIUM; PAPER; SET THEORY; STATISTICS;

APPLIED MATHEMATICS; DECOMPOSITION TECHNIQUES; HEIDELBERG (CO); HYPER GRAPH; INTERNATIONAL CONFERENCES; NEW APPROACHES; PARALLEL PROCESSING; PARALLEL RESOLUTION; PARALLEL SCHEME; SATISFIABILITY (SAT) PROBLEMS; SEARCH SPACES; SOLVE THE SATISFIABILITY (SAT); SPRINGER (CO); STRUCTURAL DECOMPOSITION; TREE-DECOMPOSITION;

BOOLEAN FUNCTIONS;

EID: 45449091936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68111-3_27     Document Type: Conference Paper

References (30)

1. http://www.cs.ubc.ca/∼hoos/SATLIB/
2. Amir, E., McIllraith, S.: Solving Satisfiability using Decomposition and the Most Constrained Subproblem. In: IJCAI 2001 Workshop on Distributed Constraint Reasoning, online http://www.cs.berkeley.edu/∼eyal/paper.html
3. Bamha, M.: An optimal skew-insensitive join and multi-join algorithm for distributed architecture. In: Andersen, K.V., Debenham, J., Wagner, R. (eds.) DEXA 2005. LNCS, vol. 3588, pp. 616-625. Springer, Heidelberg (2005)
4. Bayardo Jr., R.J., Pehousek, J.D.: Counting Models Using Connected Components. In: Proc. 17th. Nat. Conf. on AI (AAAI 2000) (2000)
5. Biere, A., Sinz, C.: Decomposing Sat Problems into Connected Components. Journal on Satisfiability, Boolean Modeling and Computation 2, 201-208 (2006)
6. Bjesse, P., Kukula, J., Damiano, R., Stanion, T., Zhu, Y.: Diagnosis with Tree Decomposition. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, Springer, Heidelberg (2004)
7. Bodlaender, H.: A Tourist Guide through Treewidth. Acta Cybernetica 11 (1993)
8. Darwiche, A.: Compiling knowledge into decomposable negation normal form. In: Proc. of 15th. IJCAI, pp. 284-289 (1999)
9. Davis, M., Logeman, G., Loveland, D.: A machine program for Theorem Proving. Com. of the ACM 5(7) (1962)
10. del Val, A.: Simplifying Binary Propositional Theories into Connected Components Twice as Fast. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, pp. 389-403. Springer, Heidelberg (2001)
11. Dequen, G., Dubois, O.: kcnfs: an efficient solver for random k-SAT formulae. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 486-501. Springer, Heidelberg (2004)
12. Durairaj, V., Kalla, P.: Exploiting Hypergraph Partitioning for Efficient Boolean Satisfiability. In: Proc. 9th. IEEE Int. High Level Design Validation and Test Work-shp, pp. 141-146 (2004)
13. Gummadi, R., Narayanaswamy, N.S., Venkatakrishnan, R.: Algorithms for Satisfiability Using Independent Sets of Variables. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, p. 2005. Springer, Heidelberg (2005)
14. Habbas, Z., Krajecki, M., Singer, D.: Decomposition Techniques for Parallel Resolution of Constraint Satisfaction Problems in Shared Memory: a Comparative Study. Int. Jour. of Computational Science and Engineering (IJCSE) 1(2-4), 192-206 (2005)
15. Herwig, P.R.: Decomposing satisfiability problems. Master's Thesis, Delft University of Technology (2006)
16. Heule, M., Kullmann, O.: Decomposing clause-sets: Integrating DLL algorithms, tree decompositions and hypergraph cuts for variable and clause-based graph representations of CNF's. TR. CSR 2-2006, Univ. Wales Swansea (2006)
17. Hicks, I.V., Koster, A., Kolotoglu, E.: Branch and Tree Decomposition Techniques for Discrete Optimization. TutORials in O.R., Informs (2005)
18. Karypis, G.: Multilevel Hypergraph partitionning. In: Cong, J., Shinnerl, J. (eds.) Multilevel Optimization Methods for VLSI, ch.6, Kluwer Ac. Pub, Dordrecht (2002)
19. Khurshid, S., Marinov, D., Shlyakhter, I., Jackson, D.: A Case for Efficient Solution Enumeration. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, Springer, Heidelberg (2004)
20. Li, W., Van Beek, P.: Guiding Real-World Sat Solving with Dynamic Hypergraph Separator Decomposition. In: Proc. 16th. IEEE Int. Conf. on Tools for AI (ICTAI 2004) (2004)
21. Marques Silva, J., Oliveira, A.: Improving Satisfiability Algorithms with Dominance and Partitioning. In: Int. Workshop on Logic Synthesis (IWLS) (1997)
22. Mishra, P., Eich, M.H.: Join Processing in Relational Databases. ACM Computing Surveys 24(1), 63-113 (1992)
23. Monnet, A.: JaCk-SAT: un nouvel algorithme de résolution paralléle du probléme SAT par décomposition structurelle. Master Thesis (in french), Université Paul Verlaine-Metz (2007)
24. Park, T.J., Van Gelder, A.: Partitioning Methods for Satisfiabilty Testing on Large Formulas. Information and Computation 162, 179-184 (2000)
25. Parkes, A.J.: Exploiting Solutions Clusters for Coarse-Grained Distributed Search. In: Workshop on Dist. Constraints Reasoning, IJCAI 2001 (2001)
26. Schloegel, K., Karypis, G., Kumar, V.: Graph Partitioning for High Performance Scientific Simulations. In: Dongarra, J., et al. (eds.) CRPC Parallel Computing Handbook, Morgan Kauffmann, San Francisco (2000)
27. Singer, D.: Parallel Resolution of the Satisfiability Problem: a Survey. In: Talbi, E.G. (ed.) Parallel Combinatorial Optimization, Wiley and Sons, Chichester (2006)
28. Singer, D., Monnet, A.: A New Decomposition Scheme for Parallel Resolution of the Satisfiability Problem (SAT). In: 14th. RCRA 2007, Roma (2007)
29. Singer, D., Vagner, A.: Parallel Resolution of the Satisfiability Problem with OpenMP and MPI. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, Springer, Heidelberg (2006)
30. Snir, M., Otto, S.W., Huss-Lederman, S., Walker, D.W., Dongarra, J.: MPI: the complete reference. The MIT Press, Cambridge (1996)