Propagation by Selective Initialization and Its Application to Numerical Constraint Satisfaction Problems
Maarten H. van EmdenBelaid MoaPublished in: CoRR (2004)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- set bounds propagation
- constraint programming
- constraint propagation
- search space
- arc consistency
- np complete
- constraint solving
- combinatorial problems
- np hard
- solving constraint satisfaction problems
- temporal constraints
- constraint networks
- non binary
- disjunctive temporal
- finite domain
- decomposition methods
- pseudo boolean optimization
- product configuration
- path consistency
- global constraints
- scheduling problem
- constraint problems
- computational problems
- forward checking
- backtracking algorithm
- backtracking search
- tractable subclasses
- sat problem