A Quantitative Solution to Constraint Satisfaction Problem (CSP).
Juan GuXiaofei HuangBin DuPublished in: New Gener. Comput. (1994)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint problems
- constraint propagation
- dynamic constraint satisfaction problems
- backtracking algorithm
- search space
- constraint programming
- np complete
- constraint solver
- graph coloring problems
- distributed constraint satisfaction problems
- constraint solving
- np hard
- arc consistency
- combinatorial problems
- non binary
- decomposition methods
- soft constraints
- optimal solution
- product configuration
- partial constraint satisfaction
- constraint networks
- hard constraints
- sat problem
- global constraints
- tree decomposition
- tractable subclasses
- distributed constraint satisfaction
- solving constraint satisfaction problems
- partial assignment
- weighted constraint satisfaction
- disjunctive temporal
- tree decompositions
- arc consistency algorithm
- partial solutions
- temporal constraints
- satisfiability problem
- phase transition
- qualitative and quantitative
- heuristic search