Résolution des pro-bì emes de satisfaction de contraintes par les techniques de décomposition structurelles, 2009. ,
hypertree decomposition for solving constraint satisfaction problems, Proceedings of International conference on Agents and Artificial Intelligence, pp.85-92, 2009. ,
Constraint Processing, 2003. ,
The cycle-cutset method for improving search performance in AI applications, Proceedings of the third IEEE on Artificial Intelligence Applications, pp.224-230, 1987. ,
Tree-clustering schemes for constraint-processing, Proceedings of the sixth National Conference on Artificial Intelligence (AAAI-88), pp.150-154, 1988. ,
DOI : 10.1016/0004-3702(89)90037-4
Heuristic Methods for Hypertree Decomposition, 2005. ,
DOI : 10.1016/0196-6774(86)90023-4
A Sufficient Condition for Backtrack-Free Search, Proceedings of IJCAI'99, pp.24-32, 1982. ,
DOI : 10.1145/322290.322292
On Tractable Queries and Constraints, Proceedings of DEXA'99, 1999. ,
DOI : 10.1007/3-540-48309-8_1
Hypertree Decompositions: A Survey, Proceedings of MFCS '01, pp.37-57, 2001. ,
DOI : 10.1007/3-540-44683-4_5
Generalized hypertree decompositions, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '07, 2007. ,
DOI : 10.1145/1265530.1265533
Constraint solving via fractional edge covers, pp.289-298, 2006. ,
DOI : 10.1145/2636918
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.831
C. stratégies hybrides pour des décompositions optimales et efficaces, 2009. ,
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
Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974. ,
DOI : 10.1016/0020-0255(74)90008-5
Genetic algorithms for generalised hypertree decompositions, European J. of Industrial Engineering, vol.1, issue.3, pp.317-340, 2005. ,
DOI : 10.1504/EJIE.2007.014690