Hybrid backtracking bounded by tree-decomposition of constraint networks.
Philippe JégouCyril TerriouxPublished in: Artif. Intell. (2003)
Keyphrases
- tree decomposition
- constraint networks
- constraint satisfaction
- backtracking algorithms
- backtracking algorithm
- tree width
- constraint satisfaction problems
- temporal reasoning
- series parallel
- reasoning problems
- search algorithm
- constraint programming
- branch and bound
- arc consistency
- path consistency
- probabilistic reasoning
- search space
- forward checking
- graph theory
- complexity bounds
- decomposition method
- answer set programming
- optimal solution
- constraint graph
- upper bound
- heuristic search
- search tree
- temporal constraints