-
Notifications
You must be signed in to change notification settings - Fork 411
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Suggested modificatin to AC-3 (aima3e Figure 6.3) #29
Comments
So, your suggestion is "... each binary constraint as two arcs (one in each direction) ..."? |
Yes. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
In the paragraph before section 6.2.1, leading up to the AC-3 algorithm's description, it states 'If we treat each variable as a node in a graph (see Figure 6.1(b)) and each binary constraint as an arc...' implies there is a one to one mapping between arcs and binary constraints. However, arcs as described in the original paper (http://www.cs.ubc.ca/~mack/Publications/AI77.pdf) are directional while the constraints/relations are un-directed (requiring two arcs for each binary constraint to be considered in the logic). This distinction is important as without it, if arcs for each direction of a binary constraint are not added, the AC-3 algorithm will fail to make the whole CSP arc-consistent.
The text was updated successfully, but these errors were encountered: