The decision tree algorithm for monotone classification presented in [4, 10] requires strictly monotone data sets. This paper addresses the problem of noise due to violation of the monotonicity constraints and proposes a modification of the algorithm to handle noisy data. It also presents...

Modular decomposition is a thoroughly investigated topic in many areas suchas switching theory, reliability theory, game theory and graph theory. Most appli-cations can be formulated in the framework of Boolean functions. In this paperwe give a uni_ed treatment of modular decomposition of...

Modular decomposition is a thoroughly investigated topic inmany areas such as switching theory, reliability theory, game theory andgraph theory. We propose an O(mn)-algorithm for the recognition of amodular set of a monotone Boolean function f with m prime implicantsand n variables. Using this...