l. GENERATING ALL SUBSETS OF {1,..., z} IN LEXICOGRAPHIC ORDER

On the basis ol a backtrack procedure for lexicographic enumeration of all subsets of a set of n elemcnts, we giue an algorithm both for determining all bases consisting offunctions from a giaen complete set in a considered sabset of the set of k-ualued logical functions, and for enumeration of all classes ol bases in the suhset. //e use the lexicographic algorithm alsolor solaing knapsack and minimal cooering problems. A cut technique is dcsuibed which is used in thes