An exact method to compute maximal implicants in a multivalued logic

The paper presents a method to determine maximal implicants in a multivalued logic. The method is used to minimize multivalued functions, complete or incomplete specified. In present, for bivalent functions are used Karnaugh diagrams or Quine-McCluskey method, and for multivalued functions are used software tools like Espresso, MVSIS2, BOOM II witch uses properties of binary decision diagrams (BDD) or SAT. The method presented here starts from a few remarks over the problem and transposes it into an equivalent problem having the computability proportional with the solution complexity.