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