Decomposition of multiple-valued relations

Authors:
M. Perkowski;M. Marek-Sadowska;L. Jozwiak;T. Luba;S. Grygiel;M. Nowicka;R. Malvi;Z. Wang;J. S. Zhang
Affiliations:
-;-;-;-;-;-;-;-;-
Venue:
ISMVL '97 Proceedings of the 27th International Symposium on Multiple-Valued Logic
Year:
1997

Citing 0
Cited 7

Graph coloring algorithms for fast evaluation of Curtis decompositions

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Learning Hardware Using Multiple-Valued Logic, Part 1: Introduction and Approach

IEEE Micro
Decomposition of Boolean Relations and Functions in Logic Synthesis and Data Analysis

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Effective and efficient FPGA synthesis through general functional decomposition

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Reconfigurable systems
General decomposition of incompletely specified sequential machines with multi-state behavior realization

Journal of Systems Architecture: the EUROMICRO Journal
Information-driven circuit synthesis with the pre-characterized gate libraries

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Reconfigurable embedded systems: Synthesis, design and application
Boolean factoring and decomposition of logic networks

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new decomposition problem: decomposition of multi-valued (MV) relations, and a method of its solution. Decomposition is non-disjoint and multi-level. A fundamental difference in decomposition of MV functions and MV relations is discussed: the column (cofactor) pair compatibility translates to the group compatibility for functions, but not for relations. This makes the decomposition of relations more difficult. The method is especially efficient for strongly unspecified data typical for Machine Learning (ML). It is implemented in program GUD-MV.