The problem of reconstructing the ANDOR expression of a positive Boolean function starting from a portion of its truth table is solved by adopting a proper algorithm, called Shadow Clustering (SC). It generates a collection of prime implicants by descending the part of the diagram of the Boolean lattice (associated with the input domain) that lies beneath the available examples. Three different versions of SC are proposed, according to the approaches adopted to perform a single move downward.
Reconstructing positive Boolean functions with Shadow Clustering
Muselli M;Quarati A
2005
Abstract
The problem of reconstructing the ANDOR expression of a positive Boolean function starting from a portion of its truth table is solved by adopting a proper algorithm, called Shadow Clustering (SC). It generates a collection of prime implicants by descending the part of the diagram of the Boolean lattice (associated with the input domain) that lies beneath the available examples. Three different versions of SC are proposed, according to the approaches adopted to perform a single move downward.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_172156-doc_14556.pdf
accesso aperto
Descrizione: Articolo pubblicato
Dimensione
171.46 kB
Formato
Adobe PDF
|
171.46 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
