1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987
2. On the feasibility of distributed constraint satisfaction;Collin,1991
3. Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition;Dechter;Artif. Intell.,1990
4. Constraint networks;Dechter,1992
5. Combining GSAT and path consistency for solving constraint satisfaction problems, 94-17;Dechter,1994