Boolean analysis of incomplete examples

DOI10.1007/3-540-61422-2_152zbMath1502.68141OpenAlexW1536004247MaRDI QIDQ5054834

Toshihide Ibaraki, Endre Boros, Kazuhisa Makino

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_152

Mathematics Subject Classification ID

Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Boolean functions (06E30)

Related Items

Variations on extending partially defined Boolean functions with missing bits. ⋮ Logical analysis of binary data with missing bits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure identification in relational data
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Error-free and best-fit extensions of partially defined Boolean functions
• Queries and concept learning
• A theory of the learnable
• Predicting Cause-Effect Relationships from Incomplete Discrete Observations