Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products.
Daya Ram GaurMuhammad KhanPublished in: ISAIM (2020)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- np complete
- search space
- constraint solving
- computational problems
- combinatorial problems
- soft constraints
- non binary
- arc consistency
- sat problem
- finite domain
- test cases
- max sat
- product configuration
- backtracking search
- temporal constraints
- constraint problems
- forward checking
- solving constraint satisfaction problems
- graph coloring problems
- search algorithm
- constraint networks
- np hard
- decomposition methods
- constraint graph
- partial constraint satisfaction