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.
B. Wyns, and L. Boullart. GECCO '07: Proceedings of the 9th annual conference on
Genetic and evolutionary computation, 2, page 1762--1762. London, ACM Press, (7-11 July 2007)
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. Wille. Conceptual Structures: Logical, Linguistic, and
Computational Issues, volume 1867 of Lecture Notes in Computer Science, Springer, Berlin/Heidelberg, (2000)
R. Wille. Proceedings of the 9th International Conference on Conceptual Structures (ICCS 2001), volume 2120 of Lecture Notes in Computer Science, page 115-128. Springer, (2001)