How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search.
Amy M. BeckwithBerthe Y. ChoueiryHui ZouPublished in: Australian Joint Conference on Artificial Intelligence (2001)
Keyphrases
- constraint satisfaction problems
- search space
- constraint satisfaction
- forward checking
- constraint programming
- constraint solver
- np complete
- constraint propagation
- search algorithm
- backtrack search
- symmetry breaking
- search problems
- non binary
- solving constraint satisfaction problems
- arc consistency
- np hard
- tractable subclasses
- ordering heuristics
- search strategy
- soft constraints
- constraint solving
- global constraints
- search tree
- finite domain
- heuristic search
- reasoning problems
- hard constraints
- constraint networks
- search strategies
- partial constraint satisfaction
- problems in artificial intelligence
- pseudo boolean optimization
- distributed constraint satisfaction
- branch and bound search
- decomposition methods
- search heuristics
- sat problem
- computational complexity