Variations on extending partially defined boolean functions with missing bits

Authors:
Endre Boros;Toshihide Ibaraki;Kazuhisa Makino
Affiliations:
RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan;Division of Systems Science, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka 560-8531, Japan
Venue:
Information and Computation
Year:
2003

Citing 12
Cited 1

Cause-effect relationships and partially defined Boolean functions

Annals of Operations Research
Computational learning theory: an introduction

Computational learning theory: an introduction
Exact learning Boolean functions via the monotone theory

Information and Computation
Reasoning with models

Artificial Intelligence
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
Logical analysis of binary data with missing bits

Artificial Intelligence
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
Boolean Analysis of Incomplete Examples

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Monotone Extensions of Boolean Data Sets

ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory

Experimental analysis of sequential decision making algorithms for port of entry inspection procedures

ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.