Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation.
Benjamin ScheidtNicole SchweikardtPublished in: MFCS (2023)
Keyphrases
- hypertree width
- hypertree decomposition
- conjunctive queries
- bounded treewidth
- tree width
- decomposition methods
- np complete
- expressive power
- integrity constraints
- query answering
- query evaluation
- tree decomposition
- database theory
- graph theory
- data exchange
- structural properties
- query language
- decomposition method
- polynomially solvable
- special case
- np hard
- probabilistic reasoning
- constraint networks