1. J. Argelich, A. Cabiscol, I. Lynce, and F. Manyà. New insights into encodings from MaxCSP into partial MaxSAT. In Proceedings of the 40th IEEE International Symposium on Multiple-Valued Logic - ISMVL 2010, pages 46–52. IEEE Computer Society, 2010.
2. A. Atserias and V. Dalmau. A combinatorial characterization of resolution width. Journal of Computer and System Sciences, 74(3):323–334, 2008.
3. G. Audemard, G. Katsirelos, and L. Simon. A restriction of extended resolution for clause learning SAT solvers. In Proceedings of the 24th AAAI Conference on Artificial Intelligence - AAAI 2010, pages 15–20. AAAI Press, 2010.
4. C. Bessière, G. Katsirelos, N. Narodytska, and T. Walsh. Circuit complexity and decompositions of global constraints. In Proceedings of the 21st International Joint Conference on Artificial Intelligence - IJCAI 2009, pages 412–418. AAAI Press, 2009.
5. E. Ben-Sasson and A. Wigderson. Short proofs are narrow - resolution made simple. Journal of the ACM, 48(2):149–169, 2001.