A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form

The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.

[1]  Angsheng Li,et al.  Resistance maximization principle for defending networks against virus attack , 2017 .

[2]  Bart Selman,et al.  The state of SAT , 2007, Discret. Appl. Math..

[3]  Krzysztof Czarnecki,et al.  SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers , 2015, SAT.

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

[5]  Jordi Levy,et al.  Generating SAT instances with community structure , 2016, Artif. Intell..

[6]  Carlos Ansótegui,et al.  The Community Structure of SAT Formulas , 2012, SAT.

[7]  Tomohiro Sonobe,et al.  Community Branching for Parallel Portfolio SAT Solvers , 2014, SAT.

[8]  Jesús Giráldez-Cru,et al.  Locality in Random SAT Instances , 2017, IJCAI.

[9]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Bart Selman,et al.  Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search , 2003, CP.

[11]  Angsheng Li,et al.  Three-Dimensional Gene Map of Cancer Cell Types: Structural Entropy Minimisation Principle for Defining Tumour Subtypes , 2016, Scientific Reports.

[12]  Vasco M. Manquinho,et al.  Community-Based Partitioning for MaxSAT Solving , 2013, SAT.

[13]  Kaile Su,et al.  Local search for Boolean Satisfiability with configuration checking and subscore , 2013, Artif. Intell..

[14]  Sebastian Fischmeister,et al.  Impact of Community Structure on SAT Solver Performance , 2014, SAT.

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

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

[17]  Maria Luisa Bonet,et al.  Community Structure in Industrial SAT Instances , 2016, J. Artif. Intell. Res..

[18]  Angsheng Li,et al.  Discovering natural communities in networks , 2015 .

[19]  Maria Luisa Bonet,et al.  Towards Industrial-Like Random SAT Instances , 2009, IJCAI.

[20]  Adrian Balint,et al.  Improving Stochastic Local Search for SAT with a New Probability Distribution , 2010, SAT.

[21]  Bart Selman,et al.  Backdoors To Typical Case Complexity , 2003, IJCAI.

[22]  Bart Selman,et al.  Ten Challenges in Propositional Reasoning and Search , 1997, IJCAI.

[23]  Angsheng Li,et al.  Decoding topologically associating domains with ultra-low resolution Hi-C data by graph structural entropy , 2018, Nature Communications.