Incremental Updates of Generalized Hypertree Decompositions

Structural decomposition methods, such as generalized hypertree decompositions, have been successfully used for solving constraint satisfaction problems (CSPs). As decompositions can be reused to solve CSPs with the same constraint scopes, investing resources in computing good decompositions is beneficial, even though the computation itself is hard. Unfortunately, current methods need to compute a completely new decomposition, even if the scopes change only slightly. In this article, we make the first steps toward solving the problem of updating the decomposition of a CSP P so that it becomes a valid decomposition of a new CSP P' produced by some modification of P. Even though the problem is hard in theory, we propose and implement a framework for effectively updating generalized hypertree decompositions. The experimental evaluation of our algorithm strongly suggests practical applicability.