14 citations · 43 across the 14 of their papers we have counts for
5 papers · 1 filter
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…
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
Wolfgang Fischl, Georg Gottlob, Davide Mario Longo +1
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been p…
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems
Hubie Chen, Georg Gottlob, Matthias Lanzinger +1
Constraint satisfaction problems (CSPs) are an important formal framework for the uniform treatment of various prominent AI tasks, e.g., coloring or scheduling problems. Solving CS…
Fractional Covers of Hypergraphs with Bounded Multi-Intersection
Georg Gottlob, Matthias Lanzinger, Reinhard Pichler +1
Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. Th…
Complexity Analysis of Generalized and Fractional Hypertree Decompositions
Georg Gottlob, Matthias Lanzinger, Reinhard Pichler +1
Hypertree decompositions (HDs), as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHDs) are hy…