1. Audemard, G., Le Berre, D., Roussel, O., Lynce, I., Marques-Silva, J.: OpenSAT: an open source SAT software project. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–509. Springer, Heidelberg (2004)
2. Fukunaga, A.: Efficient implementations of SAT local search. In: Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 287–292. Springer, Heidelberg (2005)
3. Gent, I.P., Walsh, T.: Towards an understanding of hill–climbing procedures for SAT. In: Proc. of the Eleventh Nat’l Conf. on Artificial Intelligence (AAAI 1993), pp. 28–33 (1993)
4. Gent, I.P., Walsh, T.: Unsatisfied variables in local search. In: Hybrid Problems, Hybrid Solutions, pp. 73–85 (1995)
5. Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 44, 279–303 (1990)