Variations on extending partially defined Boolean functions with missing bits.
From MaRDI portal
Publication:1400581
DOI10.1016/S0890-5401(02)00012-3zbMath1035.68057WikidataQ59560628 ScholiaQ59560628MaRDI QIDQ1400581
Toshihide Ibaraki, Kazuhisa Makino, Endre Boros
Publication date: 13 August 2003
Published in: Information and Computation (Search for Journal in Brave)
68Q32: Computational learning theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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