ASP for Anytime Dynamic Programming on Tree Decompositions.
Bernhard BliemBenjamin KaufmannTorsten SchaubStefan WoltranPublished in: IJCAI (2016)
Keyphrases
- tree decompositions
- dynamic programming
- answer set programming
- tree decomposition
- constraint satisfaction problems
- web applications
- state space
- stereo matching
- logic programming
- logic programs
- complexity bounds
- linear programming
- answer sets
- heuristic search
- decomposition method
- constraint satisfaction
- single machine
- constraint propagation
- database
- data model
- search space