Using Directed Acyclic Graphs to Coordinate Propagation and Search for Numerical Constraint Satisfaction Problems.
Xuan-Ha VuHermann SchichlDjamila Sam-HaroudPublished in: ICTAI (2004)
Keyphrases
- constraint satisfaction problems
- directed acyclic graph
- search space
- constraint satisfaction
- forward checking
- constraint programming
- backtracking search
- constraint solver
- constraint propagation
- solving constraint satisfaction problems
- search algorithm
- arc consistency
- symmetry breaking
- constraint solving
- non binary
- np complete
- partial assignment
- structural learning
- maintaining arc consistency
- set bounds propagation
- constraint networks
- equivalence class
- soft constraints
- combinatorial problems
- directed graph
- partial constraint satisfaction
- equivalence classes
- branch and bound
- random variables
- tree search
- search strategies
- heuristic search
- markov chain
- np hard