Complete Algorithms. Darwiche, A. and Pipatsrisawat, K. 185(1):99–130.
doi  abstract   bibtex   
Complete SAT algorithms form an important part of the SAT literature. From a theoretical perspective, complete algorithms can be used as tools for studying the complexities of different proof systems. From a practical point of view, these algorithms form the basis for tackling SAT problems arising from real-world applications. The practicality of modern, complete SAT solvers undoubtedly contributes to the growing interest in the class of complete SAT algorithms. We review these algorithms in this chapter, including Davis-Putnum resolution, Stalmarck's algorithm, symbolic SAT solving, the DPLL algorithm, and modern clause-learning SAT solvers. We also discuss the issue of certifying the answers of modern complete SAT solvers.
@article{darwicheCompleteAlgorithms2009,
  title = {Complete Algorithms},
  volume = {185},
  issn = {09226389},
  doi = {10.3233/978-1-58603-929-5-99},
  abstract = {Complete SAT algorithms form an important part of the SAT literature. From a theoretical perspective, complete algorithms can be used as tools for studying the complexities of different proof systems. From a practical point of view, these algorithms form the basis for tackling SAT problems arising from real-world applications. The practicality of modern, complete SAT solvers undoubtedly contributes to the growing interest in the class of complete SAT algorithms. We review these algorithms in this chapter, including Davis-Putnum resolution, Stalmarck's algorithm, symbolic SAT solving, the DPLL algorithm, and modern clause-learning SAT solvers. We also discuss the issue of certifying the answers of modern complete SAT solvers.},
  number = {1},
  journaltitle = {Frontiers in Artificial Intelligence and Applications},
  date = {2009},
  pages = {99--130},
  author = {Darwiche, Adnan and Pipatsrisawat, Knot},
  file = {/home/dimitri/Nextcloud/Zotero/storage/ESKBMUVR/SATChapter3.pdf}
}
Downloads: 0