[bib03_1]  M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
[bib03_2]  M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. Journal of the ACM, 7(3):201–215, July 1960.
[bib03_3]  M. Davis, G. Logemann, and D. Loveland. A Machine Program for Theorem-Proving. Communications of the ACM, 5(7):394–397, July 1962.
[bib03_4]  J. Marques-Silva and K. Sakallah. GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Transactions on Computers, 48(5):506–521, May 1999.
[bib03_5]  R. Bayardo and R. Schrag. Using CSP Lookback Techniques to Solve Real-World SAT Instances. Proceedings of the National Conference on Artificial Intelligence, pages 203–208, ...