Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs.
Philippe JégouSamba NdiayeCyril TerriouxPublished in: IJCAI (2007)
Keyphrases
- backtrack search
- tree decomposition
- constraint satisfaction problems
- constraint networks
- constraint satisfaction
- constraint programming
- highly efficient
- probabilistic reasoning
- branch and bound algorithm
- branch and bound
- decomposition method
- combinatorial problems
- constraint propagation
- sat solvers
- propositional satisfiability
- arc consistency
- np complete
- search space
- decomposition methods
- search strategies
- np hard
- graph theory
- parallel processing
- search algorithm
- randomly generated
- sat problem
- answer set programming
- temporal constraints
- genetic algorithm
- heuristic search
- computational complexity
- symmetry breaking
- artificial intelligence