The fractal dimension of SAT formulas
From MaRDI portal
Publication:3192184
Abstract: Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental testing process. Recently, there have been some attempts to analyze the structure of these formulas in terms of complex networks, with the long-term aim of explaining the success of these SAT solving techniques, and possibly improving them. We study the fractal dimension of SAT formulas, and show that most industrial families of formulas are self-similar, with a small fractal dimension. We also show that this dimension is not affected by the addition of learnt clauses. We explore how the dimension of a formula, together with other graph properties can be used to characterize SAT instances. Finally, we give empirical evidence that these graph properties can be used in state-of-the-art portfolios.
Recommendations
Cited in
(12)- Backdoor DNFs
- Bounds on the satisfiability threshold for power law distributed random SAT
- On the hierarchical community structure of practical Boolean formulas
- Solving non-uniform planted and filtered random SAT formulas greedily
- New width parameters for SAT and \#SAT
- Popularity-similarity random SAT formulas
- Generating SAT instances with community structure
- Fractal structure on \(k\)-SAT
- Evaluating CDCL variable scoring schemes
- Fractal Parallelism: Solving SAT in Bounded Space and Time
- Community structure inspired algorithms for SAT and \#SAT
- scientific article; zbMATH DE number 7561554 (Why is no real title available?)
This page was built for publication: The fractal dimension of SAT formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192184)