
Go backward to 5 Arc Consistency
Go up to Top
Go forward to 7 Solving a CSP via backtracking, arc consistency, hillclimbing
6 Arc Consistency
Suppose you have a relation r(X,Y) that is true of there is a
word in the word list below with first letter X and second letter
Y.
The word list is:
add | arc | bad | bud |
cup | dip | fad | odd
|
Suppose the domain of X is {a,b,c,d} and that of Y is
{a,d,i,r}.
- Is the arc <X,Y> arc consistent? If so, explain why. If
not, show what element(s) can be removed from a domain to make it arc
consistent.
- Is the arc <Y,X> arc consistent? If so, explain why. If
not, show what element(s) can be removed from a domain to make it arc
consistent.
Computational
Intelligence online
material, ©David Poole, Alan Mackworth and Randy Goebel, 1999
