The fractal dimension of SAT formulas

From MaRDI portal
Publication:3192184

DOI10.1007/978-3-319-08587-6_8zbMATH Open1423.68429arXiv1308.5046OpenAlexW3104641269WikidataQ60512053 ScholiaQ60512053MaRDI QIDQ3192184FDOQ3192184


Authors: Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru, Jordi Levy Edit this on Wikidata


Publication date: 26 September 2014

Published in: Automated Reasoning (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1308.5046




Recommendations




Cited In (12)





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)