论文信息 - A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs

A New Evaluation of Forward Checking and Its Consequences on Efficiency of Tools for Decomposition of CSPs

In this paper, a new evaluation of the complexity of forward checking for solving non-binary CSPs with finite domains is proposed. Unlike what is done usually, it does not consider the size of domains, but the size of the relations associated to the constraints. It may lead sometimes to define better complexity bounds. By using this first result, we show that the tractability hierarchy proposed in [6] which compares different methods based on a decomposition of constraint networks can be seen from a new viewpoint.

[1] Eugene C. Freuder,et al. Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[2] Rina Dechter,et al. Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[3] Philippe Jégou,et al. Hybrid backtracking bounded by tree-decomposition of constraint networks , 2003, Artif. Intell..

[4] Philippe Jégou,et al. Bounded Backtracking for the Valued Constraint Satisfaction Problems , 2003, CP.

[5] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.

[6] Georg Gottlob,et al. A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[7] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[8] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[9] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[10] Rina Dechter,et al. Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models , 2006, ECAI.

[11] Jegou Philippe,et al. Decomposition and good recording for solving Max-CSPs , 2004 .

[12] Simon de Givry,et al. Exploiting Tree Decomposition and Soft Local Consistency In Weighted CSP , 2006, AAAI.