Computer experiments to find the minimum lower unity of a monotone Boolean function

The problem of finding a minimum-norm point from the truth set of a monotone Boolean function is considered. A multiple descent algorithm is proposed for solving the problem. Some results of its application to the problem of finding the minimum covering of a binary table, which is reducible to the original problem, are presented. A formula is derived linking the average number of irredundant coverings of a binary table with its size and spectrum.