Al-Rabadi, Anas N.; Zwick, Martin Modified reconstructability analysis for many-valued functions and relations. (English) Zbl 1070.93010 Kybernetes 33, No. 5-6, 906-920 (2004). Reconstructibility analysis (RA) is a technique to decompose relations involving qualitative variables, and so in order to decompose overall systems in terms of subsystems exhibiting less complexity. After a short background survey on both conventional RA (CRA), and modified RA (MRA), the authors propose a generalized method to decompose many-valued functions. The intersection algorithm and the union algorithm are carefully illustrated by means of examples. Reviewer: Guy Jumarie (Montréal) Cited in 2 Documents MSC: 93B11 System structure simplification 68T05 Learning and adaptive systems in artificial intelligence 94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010) Keywords:decomposition; system simplification; qualitative variables; complexity; many-valued functions; intersection algorithm; union algorithm PDFBibTeX XMLCite \textit{A. N. Al-Rabadi} and \textit{M. Zwick}, Kybernetes 33, No. 5--6, 906--920 (2004; Zbl 1070.93010) Full Text: DOI References: [1] DOI: 10.1080/03081078108934809 · doi:10.1080/03081078108934809 [2] DOI: 10.1080/03081079608945112 · Zbl 0854.93012 · doi:10.1080/03081079608945112 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.