1. I. Adler, G. Gottlob and M. Grohe, Hypertree-width and related hypergraph invariants. InProc. of the 3rd European Conference on Combinatorics, Graph Theory, and Applications (EUROCOMB’05), DMTCS Proceedings Series, vol. AE (2005) 5–10.
2. A. Ait-Amokhtar, K. Amroun and Z. Habbas, Hypertree Decomposition for Solving Constraint Satisfaction Problems. InProc. of International conference on Agents and Artificial Intelligence, ICAART’2009(2009) 398–404.
3. C. Bessière and J.C. Régin, Arc Consistency for General Constraint Networks: Preliminary Results. InProc. of the Sixtenteenth International Joint Conference on Artificial Intelligence(1997) 398–404.
4. Cohen D., Jeavons P. and Gyssens M., A unified theory of structural tractability for Constraint Satisfaction Problems.J. Comput. System Sci.74(2008) 721–743.
5. Dechter R. and Pearl J., Tree clustering for constraint networks.J. Artif. Intell.38(1989) 353–366.