The impact of Entropy and Solution Density on selected SAT heuristics
Artificial Intelligence
2018-10-17 v1 Logic in Computer Science
Abstract
In a recent article [Oh'15], Oh examined the impact of various key heuristics (e.g., deletion strategy, restart policy, decay factor, database reduction) in competitive SAT solvers. His key findings are that their expected success depends on whether the input formula is satisfiable or not. To further investigate these findings, we focused on two properties of satisfiable formulas: the entropy of the formula, which approximates the freedom we have in assigning the variables, and the solution density, which is the number of solutions divided by the search space. We found that both predict better the effect of these heuristics, and that satisfiable formulas with small entropy `behave' similarly to unsatisfiable formulas.
Cite
@article{arxiv.1706.05637,
title = {The impact of Entropy and Solution Density on selected SAT heuristics},
author = {Dor Cohen and Ofer Strichman},
journal= {arXiv preprint arXiv:1706.05637},
year = {2018}
}