 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| n |
Arc Consistency
(2-consistency) can be extended to k-
|
|
|
consistency
|
|
|
| n |
3-consistency
(path consistency): any pair of adjacent
|
|
|
variables can
always be extended to a third neighbor.
|
|
|
|
n |
Catches
problem with Dx, Dy and Dz, as assignment
of Dz = 2 and
|
|
|
|
|
Dx = 3 will lead
to domain wipe out.
|
|
|
n |
But is
expensive, exponential time
|
|
|
| n |
n-consistency
means the problem is solvable in linear time
|
|
|
n |
As any selection
of variables would lead to a solution
|
|
| n |
In general,
need to strike a balance between consistency
|
|
|
and search.
|
|
|
|
n |
This is usually
done by experimentation.
|
|
