1. Atserias, A., Fichte, J.K., Thurley, M.: Clause-learning algorithms with many restarts and bounded-width resolution. J. of Artif. Intel. Research (JAIR) 40, 353–373 (2011); preliminary version in SAT 2009
2. Lecture Notes in Computer Science;F. Bacchus,2007
3. Ben-Sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. J. of the ACM 48(2), 149–169 (2001)
4. Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.G., Walsh, T.: Decompositions of all different, global cardinality and related constraints. In: Int. Joint. Conf. on Artif. Intel. (IJCAI), pp. 419–424 (2009)
5. Bessiere, C., Katsirelos, G., Narodytska, N., Walsh, T.: Circuit complexity and decompositions of global constraints. In: Int. Joint. Conf. on Artif. Intel. (IJCAI), pp. 412–418 (2009)