1. Aloul, F., Markov, I., Sakallah, K.: Force: a fast and easy-to-implement variable-ordering heuristic. In: Proc. of the 13th ACM Great Lakes Symposium on VLSI 2003, pp. 116–119 (2003)
2. Bayardo Jr., R.J., Schrag, R.C.: Using CSP look-back techniques to solve real-world SAT instances. In: AAAI’97, Providence, Rhode Island, pp. 203–208 (1997), citeseer.ist.psu.edu/article/bayardo97using.html
3. Beame, P., et al.: Memoization and dpll: Formula caching proof systems. In: Proc. of 18th Annual IEEE Conf. on Computational Complexity, Aarhus, Denmark, IEEE Computer Society Press, Los Alamitos (2003), citeseer.ist.psu.edu/beame03memoization.html
4. Biere, A., Sinz, C.: Decomposing sat problems into connected components. Journal on Satisfiability, Boolean Modeling and Computation (JSAT) 2 (2006)
5. Darwiche, A.: New advances in compiling CNF to decomposable negational normal form. In: Proc. of European Conference on AI (2004)