The dual notion is that of vertex sets such that no hyperedge exists which contains two of them; explore this notion (compare "strong independence" in Hypergraphs/IndependentSets/plans/general.hpp).
An algorithm is Knuth's "dancing links" (see http://en.wikipedia.org/wiki/Dancing_Links); likely this is rather naive (seems to be just the special case of Boehm's 2-dimensional linked list representation of clause-sets?).