Definability and Descriptive Complexity on Databases of Bounded Tree-Width.
Martin GroheJulian MariñoPublished in: ICDT (1999)
Keyphrases
- bounded tree width
- tree width
- databases
- markov networks
- first order logic
- np complete
- structural properties
- maximum likelihood
- database
- probabilistic model
- graphical models
- relational databases
- tree decomposition
- bayesian inference
- computational complexity
- data integration
- conditional random fields
- belief propagation
- shortest path
- markov random field
- data model
- lower bound