Enhancements to Crisp Possibilistic Reconstructability Analysis (Q4824747)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2113280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enhancements to Crisp Possibilistic Reconstructability Analysis |
scientific article; zbMATH DE number 2113280 |
Statements
Enhancements to Crisp Possibilistic Reconstructability Analysis (English)
0 references
1 November 2004
0 references
reconstructibility analysis
0 references
Boolean function
0 references
complexity measures
0 references
Ashenhurst-Curtis decomposition
0 references
modified reconstructibility algorithm
0 references
0.8202536702156067
0 references
0.8192656636238098
0 references
0.8091877102851868
0 references
0.7122599482536316
0 references
0.6990247368812561
0 references
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.
0 references