1. Barth, P., A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization, Technical Report MPI-I-95-2-003, Max-Plank-Institut fur Informatik, 1995.
2. Crawford, J., Auton, L., (1993) Experimental results on the cross-over point in satisfiability problems. In Proc. of the 11th National Conference on Artificial Intelligence (AAAI-93), pp. 22–28.
3. Davis, M., G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the Association for Computing Machinery 5, 7 (July 1962), 394–397.
4. Dubois, O, Andre, P., Boufkhan, Y., Carlier, J., SAT versus UNSAT, see [6].
5. (1995) Freeman, J.W., Improvements to propositional satisfiability search algorithms. Ph.D. Dissertation, Dept. of Computer Science, University of Pennsylvania.