Sign in
Back
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv
Book chapter

Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv

Endre Boros, Toshihide Ibaraki and Kazuhisa Makino
Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics, pp.257-272
Lecture Notes in Computer Science, Springer Berlin Heidelberg
08/24/2001
DOI: https://doi.org/10.1007/3-540-44929-9_20

Abstract

Boolean Function Boolean Vector Consistent Extension Partial Order Prime Implicants
In this paper we consider four difierent definitions for an extension of a partially defined Boolean function in which the input con-tains 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.

Metrics

9 Record Views

Details