title: algorithm for computing closure of a set of FDs
body: <p>I'm looking for an easy to understand algorithm to compute (by hand) a closure of a set of functional dependencies.
  Some sources, including my instructor says I should just play with Armstrong's axioms and see what I can get at. To me, that's not a systematic way about doing it (i.e. easy to miss something).</p>
  
  <p>Our course textbook (DB systems - the complete book, 2nd ed) doesn't give an algorithm for this either.</p>