A New Method for 3-Satisfiability Problem Phase Transition on Structural Entropy

The phenomenon of phase transition is an important property of the satisfiability (SAT) problem. It not only determines the difficulty of solving the problem, but also plays an important role in designing fast solving algorithms. The structural entropy is an effective method to measure the complexity of graph structure. It maps the proposition formula to the graph structure, and then gives the structural entropy of it. A new method of 3-SAT phase transition measurement based on structural entropy is proposed. Through numerical experiments on the random 3-SAT instance set, the results show that the satisfiability of the random 3-SAT problem has phase transition with the change of structural entropy. At the same time, it is very difficult to solve the problem in the region near the phase transition point.

[1]  Gaige Wang,et al.  Moth search algorithm: a bio-inspired metaheuristic algorithm for global optimization problems , 2016, Memetic Computing.

[2]  Leandro dos Santos Coelho,et al.  Earthworm optimisation algorithm: a bio-inspired metaheuristic algorithm for global optimisation problems , 2018, Int. J. Bio Inspired Comput..

[3]  Riccardo Zecchina,et al.  Survey propagation: An algorithm for satisfiability , 2002, Random Struct. Algorithms.

[4]  Guilhem Semerjian,et al.  On the Freezing of Variables in Random Constraint Satisfaction Problems , 2007, ArXiv.

[5]  Heyan Huang,et al.  Community Detection Based on Minimum-Cut Graph Partitioning , 2015, WAIM.

[6]  William T. Freeman,et al.  Understanding belief propagation and its generalizations , 2003 .

[7]  Martin J. Wainwright,et al.  A new look at survey propagation and its generalizations , 2004, SODA '05.

[8]  Stefan Szeider.  Generalizations of matched CNF formulas , 2005, Annals of Mathematics and Artificial Intelligence.

[9]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[10]  Jiulei Jiang,et al.  Warning Propagation Algorithm for the MAX-3-SAT Problem , 2019, IEEE Transactions on Emerging Topics in Computing.

[11]  Claude E. Shannon,et al.  The lattice theory of information , 1953, Trans. IRE Prof. Group Inf. Theory.

[12]  Lefteris M. Kirousis,et al.  The probabilistic analysis of a greedy satisfiability algorithm , 2002, Random Struct. Algorithms.

[13]  Frederick P. Brooks,et al.  Three great challenges for half-century-old computer science , 2003, JACM.

[14]  Suash Deb,et al.  Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization , 2017, Neural Computing and Applications.

[15]  Alan M. Frieze,et al.  The satisfiability threshold for randomly generated binary constraint satisfaction problems , 2006, RANDOM-APPROX.

[16]  Na Li,et al.  Pythagorean fuzzy interaction power Bonferroni mean aggregation operators in multiple attribute decision making , 2020, Int. J. Intell. Syst..

[17]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[18]  Riccardo Zecchina,et al.  Survey and Belief Propagation on Random K-SAT , 2003, SAT.

[19]  Angsheng Li,et al.  Structural Information and Dynamical Complexity of Networks , 2016, IEEE Transactions on Information Theory.

[20]  S. Deb,et al.  Elephant Herding Optimization , 2015, 2015 3rd International Symposium on Computational and Business Intelligence (ISCBI).

[21]  Federico Ricci-Tersenghi,et al.  Random Formulas Have Frozen Variables , 2009, SIAM J. Comput..

[22]  Riccardo Zecchina,et al.  Threshold values of random K‐SAT from the cavity method , 2003, Random Struct. Algorithms.

[23]  Rémi Monasson,et al.  Statistical mechanics methods and phase transitions in optimization problems , 2001, Theor. Comput. Sci..

[24]  Nadia Creignou,et al.  The SAT-UNSAT transition for random constraint satisfaction problems , 2009, Discret. Math..

[25]  Olivier Dubois,et al.  Typical random 3-SAT formulae and the satisfiability threshold , 2000, SODA '00.

[26]  Wei Li,et al.  Exact Phase Transitions in Random Constraint Satisfaction Problems , 2000, J. Artif. Intell. Res..

[27]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[28]  Martin E. Dyer,et al.  A probabilistic analysis of randomly generated binary constraint satisfaction problems , 2003, Theor. Comput. Sci..