17 Feb 2005
CS 3243 - Constraint Satisfaction
42
K-consistency
nArc Consistency (2-consistency) can be extended to k-consistency
n3-consistency (path consistency): any pair of adjacent variables can always be extended to a third
neighbor.
nCatches problem with Dx, Dy and Dz, as assignment of Dz = 2 and Dx = 3 will lead to domain wipe out.
nBut is expensive, exponential time
nn-consistency
means the problem is solvable in linear time
nAs any selection of variables would lead to a
solution
nIn general, need to strike a balance between consistency
and search.
nThis is usually done by experimentation.