| K-Consistency (cont.) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Node
Consistent = (Strongly) 1-Consistent |
|||||||||||||
| – | O(de)
– d variable domain size, e binary constraints (arcs in |
|||||||||||||
| constraint
graph) |
||||||||||||||
| • | Arc
Consistent = Strongly 2-Consistent |
|||||||||||||
| – | O(de2) |
|||||||||||||
| • | Path
Consistent = Strongly 3-Consistent |
|||||||||||||
| • | There
exists a K for each binary CSP such that enforcing |
|||||||||||||
| strong
K-consistency eliminates backtracking (no search). |
||||||||||||||
| • | Consistency
enforcement expensive for non-small K à |
|||||||||||||
| tradeoff |
||||||||||||||
