Solving partial constraint satisfaction problems with tree decomposition.
Arie M. C. A. KosterStan P. M. van HoeselAntoon W. J. KolenPublished in: Networks (2002)
Keyphrases
- constraint satisfaction problems
- tree decomposition
- constraint networks
- constraint problems
- constraint satisfaction
- dynamic constraint satisfaction problems
- partial constraint satisfaction
- backtracking algorithm
- constraint propagation
- constraint programming
- reasoning problems
- finding optimal solutions
- decomposition methods
- solving constraint satisfaction problems
- np complete
- tree decompositions
- constraint solvers
- partial assignment
- search space
- arc consistency
- np hard
- maintaining arc consistency
- sat encodings
- probabilistic reasoning
- configuration problems
- sat problem
- non binary
- constraint graph
- special case
- genetic algorithm
- worst case
- social network analysis
- combinatorial optimization
- branch and bound
- graph theory
- temporal constraints
- soft constraints