Count all possible unions in a collection of sets
I found the answer here.
It is called the union closure and the complexity appears to be the same as computing the number of maximal independent sets in a bipartite graph.