1. K. Apt. Some Remarks on Boolean Constraint Propagation. In New Trends in Constraints, Papers from the Joint ERCIM/Compulog-Net Workshop. Springer, 1999.
2. H. Bennaceur. The satisfiability problem regarded as a constraint satisfaction problem. In W. Wahlster, editor, Proc. of the 12th ECAI, pages 155–159. European Conference on Artificial Intelligence, Wiley, 1996.
3. C. Bessière, P. Meseguer, E. C. Freuder, and J. Larrosa. On Forward Checking for Non-binary Constraint Satisfaction. In A. Brodsky and J. Jaffar, editors, Proc. of Fifth International Conference on Principles and Practice of Constraint Programming (CP99). Springer, 1999.
4. F. Bacchus and P. van Beek. On the conversion between non-binary and binary constraint satisfaction problems. In Proc. of 15th National Conference on Artificial Intelligence, pages 311–318. AAAI Press/The MIT Press, 1998.
5. J. de Kleer. A comparison of ATMS and CSP techniques. In Proc. of the 11th IJCAI. International Joint Conference on Artificial Intelligence, 1989.