Published In

Kybernetes

Document Type

Post-Print

Publication Date

2004

Subjects

Decomposition (Mathematics), Many-valued logic, Symbolic and mathematical logic

Abstract

A novel many-valued decomposition within the framework of lossless Reconstructability Analysis is presented. In previous work, Modified Recontructability Analysis (MRA) was applied to Boolean functions, where it was shown that most Boolean functions not decomposable using conventional Reconstructability Analysis (CRA) are decomposable using MRA. Also, it was previously shown that whenever decomposition exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. In this paper, MRA is extended to many-valued logic functions, and logic structures that correspond to such decomposition are developed. It is shown that many-valued MRA can decompose many-valued functions when CRA fails to do so. Since real-life data are often manyvalued, this new decomposition can be useful for machine learning and data mining. Many-valued MRA can also be applied for the decomposition of relations.

Description

Authors' version of an article that subsequently appeared in Kybernetes, published by Emerald Group Publishing Limited. The version of record may be found at http://dx.doi.org/10.1108/03684920410533967.

DOI

10.1108/03684920410533967

Persistent Identifier

http://archives.pdx.edu/ds/psu/16502

Share

COinS