Abstract
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. © Springer-Verlag Berlin Heidelberg 2002.
Cite
CITATION STYLE
Boros, E., Ibaraki, T., & Makino, K. (2000). Fully consistent extensions of partially defined boolean functions with missing bits. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1872 LNCS, pp. 257–272). Springer Verlag. https://doi.org/10.1007/3-540-44929-9_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
