Incremental Updates of Generalized Hypertree Decompositions
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus

TL;DR
This paper introduces a framework for efficiently updating generalized hypertree decompositions (GHDs) when CSPs undergo minor modifications, reducing the need for recomputing decompositions from scratch and demonstrating practical effectiveness.
Contribution
It presents the first approach for incremental updates of GHDs in response to small CSP modifications, addressing a significant computational challenge.
Findings
The proposed algorithm effectively updates GHDs with minor CSP changes.
Experimental results show practical applicability of the incremental update method.
The framework reduces computational effort compared to recomputing GHDs from scratch.
Abstract
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 paper, we make the first steps toward solving the problem of updating the decomposition of a CSP so that it becomes a valid decomposition of a new CSP produced by some modification of . Even though the problem is hard in theory, we propose and implement a framework for effectively updating GHDs. The experimental evaluation of our algorithm strongly suggests practical applicability.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization
