The D-FLAT System for Dynamic Programming on Tree Decompositions.
Michael AbseherBernhard BliemGünther CharwatFrederico DusbergerMarkus HecherStefan WoltranPublished in: JELIA (2014)
Keyphrases
- tree decompositions
- dynamic programming
- constraint satisfaction problems
- tree decomposition
- linear programming
- state space
- complexity bounds
- stereo matching
- single machine
- special case
- expert systems
- scheduling problem
- logic programming
- np complete
- social networks
- expressive power
- constraint propagation
- constraint networks
- probabilistic reasoning