Just so you know your guidance wasn't wasted: I looked into all these references, and Codd's calculus is based on predicate calculus (like Answer Set Programming), so it all seems inspired by set builder notation, all x such that ...

  { x : property(x) }

Is encryption another example of having the result (the encrypted message) but not knowing how to make it?