A new approach to partial constraint satisfaction problems.
Dharmendra Kumar GuptaN. GuptaPublished in: Int. J. Comput. Math. (2004)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- partial assignment
- constraint propagation
- np complete
- search space
- constraint programming
- np hard
- non binary
- forward checking
- combinatorial problems
- arc consistency
- maintaining arc consistency
- constraint solving
- global constraints
- constraint networks
- sat problem
- decomposition methods
- partial constraint satisfaction
- finite domain
- finding optimal solutions
- special case
- product configuration
- state space
- random instances
- backtracking algorithm
- backtracking search
- solving constraint satisfaction problems
- symmetry breaking
- graph based representations
- orders of magnitude
- tractable subclasses
- weighted constraint satisfaction
- pseudo boolean optimization