The Fractal Dimension of SAT Formulas

Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental process. It is believed that these techniques exploit the underlying structure of industrial instances. However, there is not a precise definition of the notion of structure. Recently, there have been some attempts to analyze this structure in terms of complex networks, with the long-term aim of explaining the success of SAT solving techniques, and possibly improving them. We study the fractal dimension of SAT instances with the aim of complementing the model that describes the structure of industrial instances. We show that many industrial families of formulas are self-similar, with a small fractal dimension. We also show how this dimension is affected by the addition of learnt clauses during the execution of SAT solvers.

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

[2]  Toby Walsh,et al.  Search in a Small World , 1999, IJCAI.

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

[4]  Bart Selman,et al.  On the fine structure of large search spaces , 1999, Proceedings 11th International Conference on Tools with Artificial Intelligence.

[5]  Kevin Leyton-Brown,et al.  SATzilla: Portfolio-based Algorithm Selection for SAT , 2008, J. Artif. Intell. Res..

[6]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

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

[8]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[9]  Marián Boguñá,et al.  Popularity versus similarity in growing networks , 2011, Nature.

[10]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[11]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[12]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Benoit B. Mandelbrot,et al.  Fractal Geometry of Nature , 1984 .

[14]  Yuri Malitsky,et al.  Non-Model-Based Algorithm Portfolios for SAT , 2011, SAT.

[15]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Ulrik Brandes,et al.  On Modularity - NP-Completeness and Beyond , 2006 .

[17]  Maria Luisa Bonet,et al.  On the Structure of Industrial SAT Instances , 2009, CP.

[18]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[19]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[20]  George Katsirelos,et al.  Eigenvector Centrality in Industrial SAT Instances , 2012, CP.

[21]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  S. Havlin,et al.  How to calculate the fractal dimension of a complex network: the box covering algorithm , 2007, cond-mat/0701216.

[23]  Ran Raz,et al.  On Interpolation and Automatization for Frege Systems , 2000, SIAM J. Comput..

[24]  S. Havlin,et al.  Self-similarity of complex networks , 2005, Nature.

[25]  Yuri Malitsky,et al.  Algorithm Selection and Scheduling , 2011, CP.

[26]  Luca Pulina,et al.  A Multi-engine Solver for Quantified Boolean Formulas , 2007, CP.

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

[28]  Eoin O'Mahony,et al.  Using Case-based Reasoning in an Algorithm Portfolio for Constraint Solving ? , 2008 .

[29]  R. Geoff Dromey,et al.  An algorithm for the selection problem , 1986, Softw. Pract. Exp..

[30]  Michael Alekhnovich,et al.  Resolution Is Not Automatizable Unless W[P] Is Tractable , 2008, SIAM J. Comput..

[31]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.