Counting truth assignments of formulas of bounded tree-width or clique-width.
Eldar FischerJohann A. MakowskyElena V. RavvePublished in: Discret. Appl. Math. (2008)
Keyphrases
- bounded tree width
- tree width
- markov networks
- np complete
- structural properties
- tree decomposition
- first order logic
- expressive power
- constraint networks
- shortest path
- maximum likelihood
- parallel processing
- bayesian inference
- bayesian networks
- document classification
- hidden variables
- exact and approximate
- higher order
- np hard