Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width.
Denis LapoirePublished in: STACS (1998)
Keyphrases
- bounded tree width
- tree width
- markov networks
- np complete
- first order logic
- tree decomposition
- structural properties
- expressive power
- monadic second order logic
- constraint networks
- higher order
- shortest path
- belief propagation
- graphical models
- decomposition method
- maximum likelihood
- conditional random fields
- relational structures
- probabilistic model
- bayesian networks
- deductive databases
- bayesian inference
- posterior probability
- datalog programs
- exact and approximate
- data complexity
- graph theory
- parallel processing
- markov random field
- query language
- np hard
- document classification
- generative model
- em algorithm
- expectation maximization
- tree automata