Enhancements to Crisp Possibilistic Reconstructability Analysis

DOI10.1080/03081070310001638630MaRDI QIDQ4824747zbMATH OpenOpenAlexFDO

Authors Anas N. Al-Rabadi, Martin Zwick

Publication date 1 November 2004

Published in International Journal of General Systems (Search for Journal in Brave)

Full work available at URL https://pdxscholar.library.pdx.edu/cgi/viewcontent.cgi?article=1040&context=sysc_fac, http://pdxscholar.library.pdx.edu/sysc_fac/40

zbMATH Keywords

Ashenhurst-Curtis decompositionBoolean functioncomplexity measuresmodified reconstructibility algorithmreconstructibility analysis

Mathematics Subject Classification ID

Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)

Review text

The study is concerned with a modified version of the reconstructibility algorithm. The decomposition is presented for three-variable NPN classified Boolean functions (where the NPN notation pertains to a family of identical Boolean functions obtained by the operations of negation or permutation of one or more variables and negation of the function). The paper is self-contained by providing some generic background on the NPN classification of logic functions, complexity measures of decomposed functions, and existing reconstructibility methods. Next, the modified reconstruction analysis (MRA) is presented in detail. The material includes a comparison of lossless decomposition of the Ashenhurst-Curtis (AC) decomposition and the modified algorithm proposed in this study. The complexity of the MRA is compared with the AC decomposition. The application of the MRA to many-valued data is also covered.

Recommendations

• Modified reconstructability analysis for many‐valued functions and relations
• A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions
• Multiple-level circuit solutions to the circuit non-decomposability problem of the set-theoretic modified reconstructability analysis (MRA)
• Reversible modified reconstructability analysis of Boolean circuits and its quantum computation
• Reconstructability analysis: Aims, results, open problems

Cited in

(5)

• Modified reconstructability analysis for many‐valued functions and relations
• A comparison of modified reconstructability analysis and Ashenhurst‐Curtis decomposition of Boolean functions
• scientific article; zbMATH DE number 4215793 (Why is no real title available?)
• RECONSTRUCTABILITY ANALYSIS USING PROBABILITY INTERVALS
• Multiple-level circuit solutions to the circuit non-decomposability problem of the set-theoretic modified reconstructability analysis (MRA)

This page was built for publication: Enhancements to Crisp Possibilistic Reconstructability Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4824747)