1. J. R. Bitner and Reingold E. Backtracking programming techniques. Communications of the ACM, 18(11):651–656, 1975.
2. Fahiem Bacchus and Paul van Run. Dynamic variable reordering in CSPs. In First International Conference on Principles and Practice of Constraint Programming (CP95), 1995.
3. Peter Cheeseman, Bob Kanefsky, and Willian M. Taylor. Where the really hard problems are. In Procceedings of the International Joint Conference on Artifical Intelligence (IJCAI), pages 331–337, 1991.
4. M. J. Dent and R. E. Mercer. Minimal forward checking. In 6th IEEE International Conference on Tools with Artificial Intelligence, pages 432–438, New Orleans, 1994. Available via anonymous ftp from ftp://csd.uwo.ca/pub/csd-technical-reports/374/tai94.ps.z.
5. Daniel Frost and Rina Dechter. In search of the best constraint satisfaction search. In Proceedings of the AAAI National Conference, pages 301–306, 1994.