An algebraic approach to multi-sorted constraints
Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have the same domain. We show here that this apparently minor simplification can in fact change the complexity of the problem, and hence...
| Main Authors: | , |
|---|---|
| פורמט: | Journal article |
| שפה: | English |
| יצא לאור: |
2003
|