Variations on extending partially defined Boolean functions with missing bits.

DOI10.1016/S0890-5401(02)00012-3zbMath1035.68057OpenAlexW2008921146WikidataQ59560628 ScholiaQ59560628MaRDI QIDQ1400581

Toshihide Ibaraki, Kazuhisa Makino, Endre Boros

Publication date: 13 August 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0890-5401(02)00012-3

zbMATH Keywords

Boolean functionsExtensionsLogical analysis of dataMissing bitsPartially defined

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Polynomial-time inference of all valid implications for Horn and related formulae
• Logical analysis of numerical data
• Error-free and best-fit extensions of partially defined Boolean functions
• Logical analysis of binary data with missing bits
• Exact learning Boolean functions via the monotone theory
• Reasoning with models
• Horn Extensions of a Partially Defined Boolean Function
• Boolean analysis of incomplete examples
• The decision problem for some classes of sentences without quantifiers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item