JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) Based on Join-and-Check

This paper presents and investigates for the first time a new trail for parallel solving of the Satisfiability problem based on a simple and efficient structural decomposition heuristic. A new Joining and model Checking scheme (JaCk-SAT) is introduced. The main goal of this methodology is to recursively cut the variable-set in two subsets of about equal size. On the one hand, in contrast with recent propositions [12,16] for sequential resolution, we do not use sophisticated hypergraph decomposition techniques such as Tree Decomposition that are very likely infeasible. On the other hand, in contrast with all the actual propositions [27] for parallel resolution, we make use of a structural decomposition (of the problem) instead of a search space one. The very first preliminary results of this new approach are presented.

[1]  Wenfei Fan,et al.  Keys with Upward Wildcards for XML , 2001, DEXA.

[2]  Allen Van Gelder,et al.  Partitioning Methods for Satisfiability Testing on Large Formulas , 2000, Inf. Comput..

[3]  Michaël Krajecki,et al.  Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study , 2005, Int. J. Comput. Sci. Eng..

[4]  Margaret H. Dunham,et al.  Join processing in relational databases , 1992, CSUR.

[5]  Andrew J. Parkes.  Exploiting Solution Clusters for Coarse-Grained Distributed Search , 2001 .

[6]  Eyal Amir,et al.  Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report) , 2001, Electron. Notes Discret. Math..

[7]  Vipin Kumar,et al.  Graph partitioning for high-performance scientific simulations , 2003 .

[8]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[9]  N. S. Narayanaswamy,et al.  Algorithms for Satisfiability using Independent Sets of Variables , 2004, SAT.

[10]  E. Talbi.  Parallel combinatorial optimization , 2006 .

[11]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[12]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[13]  Adnan Darwiche.  Compiling Knowledge into Decomposable Negation Normal Form , 1999, IJCAI.

[14]  Daniel Singer.  Parallel Resolution of the Satisfiability Problem: A Survey , 2006 .

[15]  Roberto J. Bayardo,et al.  Counting Models Using Connected Components , 2000, AAAI/IAAI.

[16]  Peter van Beek,et al.  Guiding real-world SAT solving with dynamic hypergraph separator decomposition , 2004, 16th IEEE International Conference on Tools with Artificial Intelligence.

[17]  Priyank Kalla,et al.  Exploiting hypergraph partitioning for efficient Boolean satisfiability , 2004, Proceedings. Ninth IEEE International High-Level Design Validation and Test Workshop (IEEE Cat. No.04EX940).

[18]  Alvaro del Val.  Simplifying Binary Propositional Theories into Connected Components Twice as Fast , 2001, LPAR.

[19]  Mostafa Bamha.  An Optimal Skew-insensitive Join and Multi-join Algorithm for Distributed Architectures , 2005, DEXA.

[20]  Alain Vagner,et al.  Parallel Resolution of the Satisfiability Problem (SAT) with OpenMP and MPI , 2005, PPAM.

[21]  Gilles Dequen,et al.  kcnfs: An Efficient Solver for Random k-SAT Formulae , 2003, SAT.

[22]  Sarfraz Khurshid,et al.  A Case for Efficient Solution Enumeration , 2003, SAT.

[23]  Arie M. C. A. Koster,et al.  Branch and Tree Decomposition Techniques for Discrete Optimization , 2005 .

[24]  Armin Biere,et al.  Decomposing SAT Problems into Connected Components , 2006, J. Satisf. Boolean Model. Comput..

[25]  Jack Dongarra,et al.  MPI: The Complete Reference , 1996 .