3.1.11. Algorithm
Compute the closure of X under F: X+
xplus = x;
do
oldxplus = xplus;
for (each f.d. Y -> Z in F)
if (xplus implies Y) then
xplus = xplus union Z;
while (xplus != oldxplus);