Cause-effect relationships and partially defined Boolean functions
Annals of Operations Research
Computational learning theory: an introduction
Computational learning theory: an introduction
Decomposability of partially defined Boolean functions
Discrete Applied Mathematics - Special volume on partitioning and decomposition in combinatorial optimization
Logical analysis of numerical data
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Error-free and best-fit extensions of partially defined Boolean functions
Information and Computation
Horn Extensions of a Partially Defined Boolean Function
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Implementation of Logical Analysis of Data
IEEE Transactions on Knowledge and Data Engineering
Monotone Extensions of Boolean Data Sets
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Logical analysis of binary data with missing bits
Artificial Intelligence
| Hi-index | 0.00 |
In this paper we consider four different definitions for an extension of a partially defined Boolean function in which the input contains some missing bits. We show that, for many general and reasonable families of function classes, three of these extensions are mathematically equivalent. However we also demonstrate that such an equivalence does not hold for all classes.