Fully consistent extensions of partially defined Boolean functions with missing bits

DOI10.1007/3-540-44929-9_20MaRDI QIDQ4536430zbMATH OpenFDO

Authors Endre Boros, Toshihide Ibaraki, Kazuhisa Makino

Publication date 25 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44929-9_20

zbMATH Keywords

partially defined Boolean function

Mathematics Subject Classification ID

Boolean functions (06E30)

Recommendations

• Variations on extending partially defined Boolean functions with missing bits.
• scientific article; zbMATH DE number 1436990
• Logical analysis of binary data with missing bits
• Horn Extensions of a Partially Defined Boolean Function
• Boolean analysis of incomplete examples

Cited in

(10)

• Recognition of interval Boolean functions
• Logical analysis of numerical data
• Variations on extending partially defined Boolean functions with missing bits.
• Logical analysis of data -- the vision of Peter L. Hammer
• Conditions of the affine extension of an incompletely defined Boolean function
• scientific article; zbMATH DE number 3843667 (Why is no real title available?)
• scientific article; zbMATH DE number 139644 (Why is no real title available?)
• Boolean analysis of incomplete examples
• scientific article; zbMATH DE number 5174795 (Why is no real title available?)
• Analysing DNA microarray data using Boolean techniques

This page was built for publication: Fully consistent extensions of partially defined Boolean functions with missing bits

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