Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation.
Benjamin ScheidtNicole SchweikardtPublished in: CoRR (2023)
Keyphrases
- hypertree width
- hypertree decomposition
- conjunctive queries
- bounded treewidth
- decomposition methods
- tree width
- database theory
- query answering
- expressive power
- np complete
- integrity constraints
- structural properties
- decision problems
- graph theory
- constraint satisfaction problems
- tree decomposition
- data exchange
- search algorithm
- feature vectors
- computational complexity