Variations on extending partially defined Boolean functions with missing bits.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4164874 (Why is no real title available?)
- scientific article; zbMATH DE number 53984 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1104349 (Why is no real title available?)
- scientific article; zbMATH DE number 1759476 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- Boolean analysis of incomplete examples
- Error-free and best-fit extensions of partially defined Boolean functions
- Exact learning Boolean functions via the monotone theory
- Horn Extensions of a Partially Defined Boolean Function
- Logical analysis of binary data with missing bits
- Logical analysis of numerical data
- Polynomial-time inference of all valid implications for Horn and related formulae
- Reasoning with models
- The decision problem for some classes of sentences without quantifiers
Cited in
(6)- Conditions of the affine extension of an incompletely defined Boolean function
- scientific article; zbMATH DE number 5174795 (Why is no real title available?)
- scientific article; zbMATH DE number 3843667 (Why is no real title available?)
- scientific article; zbMATH DE number 1759476 (Why is no real title available?)
- Logical analysis of binary data with missing bits
- Boolean analysis of incomplete examples
This page was built for publication: Variations on extending 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 Q1400581)