Kernels of monotone systems on a semi-lattice of sets

Algorithms for identification of extremal sets that are developed by the method of monotone systems are modified for analysis of conditions for an arbitrary finite semilattice of sets. Such semi-lattices can be generated as solution of inequalities defined by a totality of monotone systems. The proposed modifications lead to new automatic classification algorithms.