1. Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, and Bart Selman. Generating satisfiable problems instances. In Proc. of 17th National Conference on Artificial Intelligence, pages 256–261. 2000.
2. R. Bejar and F. Manya. Solving the round robin problem using propositional logic. In Proc. of 17th National Conference on Artificial Intelligence, pages 262–266. 2000.
3. C. Bessière, P. Meseguer, E.C. Freuder, and J. Larrosa. On forward checking for nonbinary constraint satisfaction. In Proc. of 5th Int. Conf. on Principles and Practice of Constraint Programming (CP99), pages 88–102. 1999.
4. B.M.W. Cheng, K.M.F. Choi, J.H.M. Lee, and J.C.K. Wu. Increasing constraint propagation by redundant modeling: an experience report. Constraints, 4:167–192,1999.
5. Xinguang Chen. A Theoretical Comparison of Selected CSP Solving and ModellingTechniques. PhD thesis, Dept. of Computing Science, University of Alberta, 2000.