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
A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition, IJCAI'05, pp.72-77, 2005. ,
Recursive conditioning, Artificial Intelligence, vol.126, issue.1-2, pp.5-41, 2001. ,
DOI : 10.1016/S0004-3702(00)00069-2
URL : http://doi.org/10.1016/s0004-3702(00)00069-2
Décomposition arborescente et cohérence locale souple dans les CSP pondérés, Proceedings of JFPC'06, 2006. ,
Bucket elimination: A unifying framework for reasoning, Artificial Intelligence, vol.113, issue.1-2, pp.41-85, 1999. ,
DOI : 10.1016/S0004-3702(99)00059-4
Constraint processing, 2003. ,
Tree clustering for constraint networks, Artificial Intelligence, vol.38, issue.3, pp.353-366, 1989. ,
DOI : 10.1016/0004-3702(89)90037-4
Computer and Intractability, A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence, vol.124, pp.343-282, 1979. ,
Hypertree Decompositions and Tractable Queries, Journal of Computer and System Sciences, vol.64, issue.3, pp.579-627, 2002. ,
DOI : 10.1006/jcss.2001.1809
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
Minimal triangulations of graphs: A survey, Discrete Mathematics, vol.306, issue.3, pp.306-3297, 2006. ,
DOI : 10.1016/j.disc.2005.12.003
A Structure-Based Variable Ordering Heuristic for SAT, Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), pp.1167-1172, 2003. ,
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks, Proceedings of CP, pp.777-781, 2005. ,
DOI : 10.1007/11564751_63
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
Decomposition and good recording for solving Max-CSPs, Proc. of ECAI, pp.196-200, 2004. ,
Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition, Proceedings of ICTAI, pp.542-548, 2004. ,
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models, Proc. of ECAI, pp.138-142, 2006. ,
Resolution versus Search : Two Strategies for SAT, Journal of Automated Reasoning, vol.24, issue.1/2, pp.225-275, 2000. ,
DOI : 10.1023/A:1006303512524
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
Contradicting conventional wisdom in constraint satisfaction, Proc. of ECAI, pp.125-129, 1994. ,
DOI : 10.1007/3-540-58601-6_86
Bounded Backtracking for the Valued Constraint Satisfaction Problems, Proceedings of CP, pp.709-723, 2003. ,
DOI : 10.1007/978-3-540-45193-8_48