17 Feb 2005
CS 3243 - Constraint Satisfaction
36
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
nIf X loses a
value, neighbors of X need to be (re)checked
nArc
consistency detects failure earlier than forward checking
nCan
be run as a preprocessor or after each assignment
