Showing cs.AIShow all
2 papers · 1 filter
cs.AI2022
Incremental Updates of Generalized Hypertree Decompositions
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo +1
Structural decomposition methods, such as generalized hypertree decompositions, have been successfully used for solving constraint satisfaction problems (CSPs). As decompositions c…
cs.AI2020
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo +2
Constraint Satisfaction Problems (CSPs) play a central role in many applications in Artificial Intelligence and Operations Research. In general, solving CSPs is NP-complete. The st…