Simulation of Behavior and Intelligence

Extremal subset search algorithms for monotone constraints

M. V. Sapir

Sverdlovsk

Abstract: Two computing algorithms, Alpha and Beta, are proposed which look for nestingminimal sets of informative features with the constraint measure monotone. A problem equivalent to decoding a monotone Boolean function, mbf, is shown to be solved in the process. Alpha and Beta are compared with some earlier mbf-decoding algorithms by existing and some nove and useful criteria. The proposed algorithms are shown to have certain advantages.

UDC: 62-506


Received: 03.02.1986

 English version: Automation and Remote Control, 1988, 49:1, 95–101

Bibliographic databases:

•