Variations on extending partially defined Boolean functions with missing bits
In this paper we consider four possible definitions for extending a partially defined Boolean function in which the input contains some missing bits. We show somewhat surprisingly that, for many general and frequently used families of function classes, three of these notions of an extension are mathematically equivalent, though such an equivalence does not hold universally, as demonstrated by several examples. (C) 2002 Elsevier Science (USA). All rights reserved.
partially defined boolean functions boolean functions missing bits extensions logical analysis of data