Boolean analysis of incomplete examples
From MaRDI portal
Recommendations
- Logical analysis of binary data with missing bits
- scientific article; zbMATH DE number 1560340
- scientific article; zbMATH DE number 1436990
- Variations on extending partially defined Boolean functions with missing bits.
- Fully consistent extensions of partially defined Boolean functions with missing bits
Cites work
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A theory of the learnable
- Error-free and best-fit extensions of partially defined Boolean functions
- Fully consistent extensions of partially defined Boolean functions with missing bits
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 4164874 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Predicting Cause-Effect Relationships from Incomplete Discrete Observations
- Queries and concept learning
- Structure identification in relational data
Cited in
(4)
This page was built for publication: Boolean analysis of incomplete examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054834)