A Forward-Checking algorithm based on a Generalised Hypertree Decomposition for solving non-binary constraint satisfaction problems
Résumé
Methods exploiting hypertree decompositions are considered as the best approach for solving extensional constraint satisfaction problems (CSPs) on finite domains, with regard to theoretical time complexity when fixed widths are considered. However, this result has not been confirmed in practice because of the memory explosion problem. In this article, a new approach for efficient solving extensional non-binary CSPs is proposed. It is a combination of an enumerative search algorithm which is memory efficient and a Generalised Hypertree Decomposition (GHD) that is time efficient. This new approach is a cluster-oriented Forward-Checking algorithm. It considers the solutions of the subproblems deriving from the decomposition, as the values to be assigned rather than the values associated with the variables of the initial problem. In addition, the algorithm is guided by an order induced by the clusters deriving from the GHD. Moreover, two improved versions of this algorithm are proposed. The first version uses nogoods and the second one improves it again by a dynamic reordering of subtrees. All these algorithms have been implemented and the experimental results are promising.