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.
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)
J. Klinger. Proceedings of the 9th International Conference on Conceptual Structures (ICCS 2001), volume 2120 of Lecture Notes in Computer Science, page 101-114. Springer, (2001)
T. Yu, and J. Miller. Genetic Programming, Proceedings of EuroGP'2001, volume 2038 of LNCS, page 204--217. Lake Como, Italy, Springer-Verlag, (18-20 April 2001)