1. F. Bacchus. A uniform view of backtracking. In Unpublished manuscript, 2000.
http://www.cs.toronto.edu/~fbacchus/on-line
.
2. R. Backofen and S. Will. Excluding symmetries in constraint based search. In Proceedings CP’99, pages 400–405, 1999.
3. Lect Notes Comput Sci;B. Benhamou,1994
4. F. Focacci. Solving Combinatorial Optimization Problems in Constraint Programming. PhD thesis, Fac. Ingegneria, Universita’ di Ferrara, Italy, 2001.
http://www-lia.deis.unibo.it/Research/TechReport/lia01005.zip
.
5. E. Freuder. Eliminating interchangeble values in constraint satisfaction problems. In Proceedings AAAI’91, pages 227–233, 1991.