17 Feb 2005
CS 3243 - Constraint Satisfaction
33
Arc consistency
nSimplest form of propagation makes each arc consistent
nX àY is consistent iff
for every value x of X there is some
allowed y
nArcs are directed, a binary constraint becomes two arcs
nNSW Þ SA arc
originally not consistent, is consistent after deleting blue
