Tree clustering for constraint networks (research note)
Artificial Intelligence
Topological parameters for time-space tradeoff
Artificial Intelligence
A comparison of structural CSP decomposition methods
Artificial Intelligence
Hybrid backtracking bounded by tree-decomposition of constraint networks
Artificial Intelligence
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Exploiting Decomposition in Constraint Optimization Problems
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Dynamic management of heuristics for solving structured CSPs
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Distributed tree decomposition with privacy
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining five classes of variable orders more and more dynamic which preserve the time complexity bound. For that, we define extensions of this theoretical time complexity bound to increase the dynamic aspect of these orders. We define a constant k allowing us to extend the classical bound from O(exp(w + 1)) firstly to O(exp(w + k + 1)), and finally to O(exp(2(w + k+1)-s-)), with w the "tree-width" of a CSP and s- the minimum size of its separators. Finally, we assess the defined theoretical extension of the time complexity bound from a practical viewpoint.