On Identifying Infeasible Subsets in Constraint Satisfaction Problems.
Jun HuPhilippe GalinierAlexandre CaminadaPublished in: IC-AI (2010)
Keyphrases
- constraint satisfaction problems
- search space
- constraint satisfaction
- np complete
- constraint programming
- arc consistency
- constraint solving
- constraint propagation
- non binary
- decomposition methods
- constraint graph
- combinatorial problems
- soft constraints
- solving constraint satisfaction problems
- constraint optimization
- finite domain
- constraint problems
- backtracking search
- product configuration
- computational problems
- global constraints
- partial constraint satisfaction
- tractable subclasses
- np hard
- sat problem
- temporal constraints
- path consistency
- disjunctive constraints
- arithmetic constraints
- disjunctive temporal