Improving configuration checking for satisfiable random k-SAT instances

@article{Abram2014ImprovingCC,
  title={Improving configuration checking for satisfiable random k-SAT instances},
  author={Andr{\'e} Abram{\'e} and Djamal Habet and Donia Toumi},
  journal={Annals of Mathematics and Artificial Intelligence},
  year={2014},
  volume={79},
  pages={5-24}
}
Local search algorithms based on the Configuration Checking (CC) strategy have been shown to be efficient in solving satisfiable random k-SAT instances. The purpose of the CC strategy is to avoid the cycling problem, which corresponds to revisiting already flipped variables too soon. It is done by considering the neighborhood of the formula variables. In this paper, we propose to improve the CC strategy on the basis of an empirical study of a powerful algorithm using this strategy. The first… CONTINUE READING