Complete Boolean Satisfiability Solving Algorithms Based on Local Search

@article{Guo2013CompleteBS,
  title={Complete Boolean Satisfiability Solving Algorithms Based on Local Search},
  author={Wensheng Guo and Guowu Yang and William N. N. Hung and Xiaoyu Song},
  journal={Journal of Computer Science and Technology},
  year={2013},
  volume={28},
  pages={247-254}
}
Boolean satisfiability (SAT) is a well-known problem in computer science, artificial intelligence, and operations research. This paper focuses on the satisfiability problem of Model RB structure that is similar to graph coloring problems and others. We propose a translation method and three effective complete SAT solving algorithms based on the… CONTINUE READING