Bi-Decompositions of Multi-Valued Functions for Circuit Design and Data Mining Applications

  • Authors:

  • Bernd Steinbach;Marek A. Perkowski;Christian Lang

  • Affiliations:

  • -;-;-

  • Venue:
  • ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present efficient algorithms for the bi-decomposition of arbitrary incompletely specified functions in variable-valued logic. Several special cases are discussed. The algorithms are especially applicable for Data Mining applications, because, in contrast to the general multi-valued approaches to function decomposition that decompose to arbitrary tables, we create a network from multi-valued two-input operators that are selected by the user. Such decompositions lead to decision rules that are easier to understand by humans.