Error-free and best-fit extensions of partially defined Boolean functions
type: Item
instance of: scholarly article
title: Error-free and best-fit extensions of partially defined Boolean functions
zbMATH Open document ID: 0892.68091
author: Endre Boros
author: Toshihide Ibaraki
author: Kazuhisa Makino
published in: Information and Computation
publication date: 1998-07-27T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 06E30
zbMATH DE Number: 1138507
zbMATH Keywords: partially defined Boolean functions
zbMATH Keywords: learning from examples
zbMATH Keywords: induction
zbMATH Keywords: minimum error extension
zbMATH Keywords: polynomial algorithms
zbMATH Keywords: NP-hardness
MaRDI profile type: Publication
OpenAlex ID: W2026480866
cites work: The complexity and approximability of finding maximum feasible subsystems of linear relations
cites work: Queries and concept learning
cites work: Q4004178
cites work: Complexity of identification and dualization of positive Boolean functions
cites work: Decomposability of partially defined Boolean functions
cites work: Predicting Cause-Effect Relationships from Incomplete Discrete Observations
cites work: Q4165164
cites work: Q3491589
cites work: Structure identification in relational data
cites work: On Learning Ring-Sum-Expansions
cites work: Q4198056
cites work: Q4268444
cites work: Q5519710
cites work: Q5519711
cites work: The decision problem for some classes of sentences without quantifiers
cites work: Q5655273
cites work: Computational limitations on learning from examples
cites work: Q3997892
cites work: A theory of the learnable
DOI: 10.1006/INCO.1997.2687
description: scientific article; zbMATH DE number 1138507