MUSE CSP: An Extension to the Constraint Satisfaction Problem.
Randall A. HelzermanMary P. HarperPublished in: J. Artif. Intell. Res. (1996)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- arc consistency
- np complete
- constraint programming
- np hard
- combinatorial problems
- search space
- soft constraints
- finite domain
- constraint networks
- decomposition methods
- constraint solving
- global constraints
- non binary
- backtracking search
- constraint problems
- special case
- sat problem
- product configuration
- tree decomposition
- constraint graph
- pseudo boolean optimization
- reasoning problems
- temporal constraints
- tractable classes
- scheduling problem
- solving constraint satisfaction problems
- tree decompositions
- tractable subclasses
- disjunctive temporal
- weighted constraint satisfaction