deletions | additions       diff --git a/subsection_A_B_Since_A__.tex b/subsection_A_B_Since_A__.tex  index 7e8595d..fc75ddc 100644  --- a/subsection_A_B_Since_A__.tex  +++ b/subsection_A_B_Since_A__.tex 
...
\(D_C = \{0, 1, 2, 3, 4\}\)  \subsection{. \((B, A)\)}  Since \(B = A - 1\) is the constraint, Domain \(D_B\) will be reduced to \{0, 1, 2, 3\} to be make arc \((B, A)\) arc-consistent. 
...
\(D_C = \{0, 1, 2, 3, 4\}\)  \subsection{. \((B, C)\)}  Since \(B = 2C\) is the constraint, Domain \(D_B\) will be reduced to \{0, 2\} to be make arc \((B, C)\) arc-consistent. 
...
\(D_C = \{0, 1, 2, 3, 4\}\)  \subsection{. \((C, B)\)}  Since \(C = frac{B}{2}\) is the constraint, Domain \(D_C\) will be reduced to \{0, 1\} to be make arc \((C, B)\) arc-consistent. 
...
\(D_B = \{0, 2\}\)  \(D_C = \{0, 1\}\)  Assuming that we have no other arcs to process, the following is the constraint graph constructed: