Heuristic minimization of multiple-valued relations

The authors propose a heuristic procedure for the minimization problem of multiple-valued relations based on a paradigm of the more advanced two-level minimization techniques for regular functions. The goal of the procedure is to find a compatible representation with the minimum number of the product terms. The authors present some special properties associated with relations not found in functions. These properties must be carefully accounted for while implementing a procedure that is effective in achieving high quality results. The authors have implemented these algorithms in a program called GYOCRO, and provide experimental evidence of their effectiveness.<>