On the Tree Width of Ada Programs.
Bernd BurgstallerJohann BliebergerBernhard ScholzPublished in: Ada-Europe (2004)
Keyphrases
- tree width
- structural properties
- tree decomposition
- shortest path
- constraint networks
- parallel processing
- computationally challenging
- conjunctive queries
- databases
- constraint satisfaction
- answer set programming
- pattern matching
- probabilistic reasoning
- decomposition method
- markov random field
- probability distribution
- special case