If you are a newcomer to the SATisfiability problem, you might want to take a look at wikipedia's page on the boolean satisfiability problem first. You might also find those surveys of interest. For a deeper insight of the current interest on SAT solvers for software and hardware verification, Armin Biere's course on formal systems is a good start. Eugene Goldberg has also a nice and somehow non standard way of introducing modern SAT solvers in his three part course on SAT.
R. O'Donnell. (2021)cite arxiv:2105.10386Comment: First edition originally published April 2014, in hardcover book format by Cambridge University Press, and electronically on the author's website. This arXiv version corrects 100+ typos and errors, but is otherwise essentially the same.
R. Rudell, and A. Sangiovanni-Vincentelli. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions
on, 6 (5):
727-750(September 1987)
R. Wille. Conceptual Structures: Logical, Linguistic, and
Computational Issues, volume 1867 of Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, (2000)
A. Waraich. ITiCSE '04: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education, page 97-101. New York, NY, USA, ACM, (2004)