As a form of knowledge acquisition from data, we consider the problem of deciding whether there exists an extension of a partially defined Boolean function with missing data (T, F), where T (resp., F) is a set of positive (resp., negative) examples. Here, “*”denotes a missing bit in the data, and it is assumed that T ⊆ {0,1, *}n and F ⊆ {0,1, *}n hold. A Boolean function f: {0,1}n → {0,1} is an extension of (T,F) if it is true (resp., false) for the Boolean vectors corresponding to positive (resp., negative) examples; more precisely, we define three types of extensions called consistent, robust and most robust, depending upon how to deal with missing bits. We then provide polynomial time algorithms or prove their NP-hardness for the problems under various restrictions.
CITATION STYLE
Boros, E., Ibaraki, T., & Makino, K. (1996). Boolean analysis of incomplete examples. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1097, pp. 440–451). Springer Verlag. https://doi.org/10.1007/3-540-61422-2_152
Mendeley helps you to discover research relevant for your work.