I. Adler, G. Gottlob, and M. Grohe, Hypertree width and related hypergraph invariants, European Journal of Combinatorics, vol.28, issue.8, pp.2167-2181, 2007.
DOI : 10.1016/j.ejc.2007.04.013
URL : https://hal.archives-ouvertes.fr/hal-01184381

C. Bessì-ere, P. Meseguer, E. C. Freuder, and J. Larrosa, On forward checking for non-binary constraint satisfaction, Artificial Intelligence, vol.141, issue.1-2, pp.205-224, 2002.
DOI : 10.1016/S0004-3702(02)00263-1

R. Dechter, Constraint processing, 2003.

R. Dechter, Tractable Structures for Constraint Satisfaction Problems Chapter in the Handbook of Constraint Programming F, pp.209-244, 2006.

R. Dechter, L. Otten, and R. Marinescu, On the Practical Significance of Hypertree vs. Tree Width, ECAI, pp.913-914, 2008.

R. Dechter and J. Pearl, Tree clustering for constraint networks, Artificial Intelligence, vol.38, issue.3, pp.353-366, 1989.
DOI : 10.1016/0004-3702(89)90037-4

A. Dermaku, T. Ganzow, G. Gottlob, B. Macmahan, N. Musliu et al., Heuristic Methods for Hypertree Decomposition, MICAI, 2008.
DOI : 10.1016/0196-6774(86)90023-4

G. Gottlob, N. Leone, and F. Scarcello, On Tractable Queries and Constraints, Proceedings of the 18th Symposium on Principles of Database Systems (PODS-99), pp.21-32, 1999.
DOI : 10.1007/3-540-48309-8_1

G. Gottlob, N. Leone, and F. Scarcello, A comparison of structural CSP decomposition methods, Artificial Intelligence, vol.124, issue.2, pp.343-282, 2000.
DOI : 10.1016/S0004-3702(00)00078-3

G. Gottlob, N. Leone, and F. Scarcello, Robbers, marshals, and guards, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '01, pp.775-808, 2003.
DOI : 10.1145/375551.375579

G. Gottlob and M. Samer, A backtracking-based algorithm for hypertree decomposition, Journal of Experimental Algorithmics, vol.13, 2008.
DOI : 10.1145/1412228.1412229

M. Grohe and D. Marx, Constraint solving via fractional edge covers, SODA, pp.289-298, 2006.

R. Haralick and G. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

P. Jégou, S. N. Ndiaye, and C. Terrioux, Computing and Exploiting Tree-Decompositions for Solving Constraint Networks, CP, pp.777-781, 2005.
DOI : 10.1007/11564751_63

P. Jégou, S. N. Ndiaye, and C. Terrioux, A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs, 2008 20th IEEE International Conference on Tools with Artificial Intelligence, pp.486-490, 2008.
DOI : 10.1109/ICTAI.2008.116

P. Jégou and C. Terrioux, Hybrid backtracking bounded by tree-decomposition of constraint networks, Artificial Intelligence, vol.146, issue.1, pp.43-75, 2003.
DOI : 10.1016/S0004-3702(02)00400-9

K. Kask, R. Dechter, J. Larrosa, and A. Dechter, Unifying tree decompositions for reasoning in graphical models, Artificial Intelligence, vol.166, issue.1-2, pp.165-193, 2005.
DOI : 10.1016/j.artint.2005.04.004

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4

D. Sabin and E. Freuder, Contradicting conventional wisdom in constraint satisfaction, Proc. of ECAI, pp.125-129, 1994.
DOI : 10.1007/3-540-58601-6_86

R. Tarjan and M. Yannakakis, Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing, vol.13, issue.3, pp.566-579, 1984.
DOI : 10.1137/0213035