On Application of the Ternary Matrix Cover Technique for Minimization of Boolean Functions

Abstract

To solve the task of recognizing features of objects used in expert systems the Boolean function approach can be attracted. In particular, the relation between the features can be given as a disjunctive normal form (DNF) of the Boolean function whose arguments correspond to the features, and the rise of compactness of the information of that relation reduces to minimization of a Boolean function in DNF class. The ternary matrix cover technique is suggested to apply for solving this problem. It is shown how to obtain a minimal set of prime implicants using this technique.