4.

7 Parallel/Distributed Consistency Achievement 111

∩  ∪
x 2 ∈ Z ∧ x1 ≠ x2  v2 ∈ Dx
v ( 〈x 2, v 2 〉) ∧ c ( 〈x 1, v 1 〉 〈x 2, v 2 〉) 

2

where Z is the set of variables in the problem and D x is the domain of x2.
2
Figure 4.4 shows the input connections to the v-node for <x,a>.

values
variables a b
x

<x,a> <x,a>

<x,b> <x,b>

<y,a> <y,b> <z,a> <z,b>

Constraint Cx,y Constraint Cx,z

<y,a>
v-node
c-node <y,b>
OR connection
<z,a> <z,b>
AND connection

Constraint Cy,z

Figure 4.4 A connectionist representation of a binary CSP (Z, D, C),

where the variables Z = {x, y, z} and all the domains are {a, b} (only three
sets of connections are shown here)