H. E. Dixon and M. L. Ginsberg, Inference methods for a pseudo-boolean satisfiability solver, AAAI 2002, pp.635-640, 2002.

M. Alekhnovich, E. Ben-sasson, A. A. Razborov, and A. Wigderson, Space complexity in propositional calculus, SIAM J. Comput, vol.31, issue.4, pp.1184-1211, 2002.

M. Soos, K. Nohl, and C. Castelluccia, Extending sat solvers to cryptographic problems, SAT 2009, pp.244-257, 2009.

T. Laitinen, T. Junttila, and I. Niemel, Extending clause learning DPLL with parity reasoning, ECAI 2010, pp.21-26, 2010.

R. Ostrowski, É. Grégoire, B. Mazure, and L. Sais, Recovering and exploiting structural knowledge from cnf formulas, Principles and Practice of Constraint Programming -CP 2002, 8th International Conference, pp.185-199, 2002.