Abstract

In Part I of this paper, an abstract analogue of the minimization problem for Boolean functions and of the notion of prime implicant is defined, so that this general problem can be solved in the same steps as in the classical case: 1) determination of the prime implicants; 2) determination of all the solutions made up of prime implicants. In Part II it is shown that the classical minimization problem, as well as certain set-theoretical and graphtheoretical problems are particular cases of the general problem defined in Part I