An efficient procedure for the generation of closed subsets
An efficient algorithm is described for generating subsets of a set <italic>S</italic> which satisfy constraints of the form: “If <italic>s<subscrpt>i</subscrpt></italic> is a member of the subset, then <italic>s<subscrpt>j</subscrpt></italic> must also be a member of the subset.” The algorithm has been programmed in the WISP language and successfully run on the IBM 7094 in connection with a routine to detect feedback in multidimensional iterative networks.