Related Experiment Video
Updated: Sep 1, 2025

Operation of the Collaborative Composite Manufacturing CCM System
Published on: October 1, 2019
Fast and parallel decomposition of constraint satisfaction problems
Georg Gottlob1, Cem Okulmus2, Reinhard Pichler2
1University of Oxford, Oxford, UK.
We developed faster algorithms and parallelization techniques to compute Generalized Hypertree Decompositions (GHDs) for complex Constraint Satisfaction Problems (CSPs). This enables efficient computation of optimal GHDs for a wider range of problems.
Area of Science:
- Artificial Intelligence
- Computational Complexity
Background:
- Constraint Satisfaction Problems (CSPs) are computationally challenging.
- Decomposition methods are crucial for solving complex CSPs.
- Computing optimal decompositions like Generalized Hypertree Decompositions (GHDs) has been algorithmically limited.
Purpose of the Study:
- To present algorithmic improvements and parallelization techniques for faster GHD computation.
- To enhance the ability to compute optimal GHDs for a broader range of CSP instances.
- To provide a foundation for CSPs and related problems using structural properties.
Main Methods:
- Algorithmic enhancements for GHD computation.
- Development of parallelization techniques.
- Focus on computing minimal-width GHDs.
Main Results:
- Significantly faster computation of Generalized Hypertree Decompositions (GHDs).
- Enables computation of optimal GHDs for a wider array of CSP instances.
- Improved performance on modern computing architectures.
Conclusions:
- The presented methods advance the practical computation of GHDs.
- Facilitates the evaluation of CSPs and related problems (e.g., Conjunctive Query answering) via structural analysis.
- Opens new possibilities for applying GHDs in AI and database systems.
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Constraints and Statical Determinacy
Statically Indeterminate Problem Solving
Theorems of Pappus and Guldinus: Problem Solving
Collisions in Multiple Dimensions: Problem Solving
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
Principle of Moments: Problem Solving
One such scenario involves a pole placed in a three-dimensional system with a cable attached. When a tension is applied to the cable, the moment about the z-axis passing through...

