Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems.
Eugene C. FreuderMichael J. QuinnPublished in: IJCAI (1985)
Keyphrases
- constraint satisfaction problems
- finite domain
- constraint satisfaction
- constraint problems
- arithmetic constraints
- soft constraints
- constraint graph
- constraint programming
- constraint propagation
- np complete
- configuration problems
- arc consistency
- combinatorial problems
- search space
- binary constraints
- partial constraint satisfaction
- constraint solver
- partial assignment
- real numbers
- constraint solving
- computational problems
- non binary
- product configuration
- forward checking
- sat problem
- constraint networks
- np hard
- decomposition methods
- backtracking search
- solving constraint satisfaction problems
- global constraints
- temporal constraints
- maintaining arc consistency
- variable ordering heuristics
- finding optimal solutions
- bounded treewidth
- objective function
- symmetry breaking