Error-free and best-fit extensions of partially defined Boolean functions

DOI10.1006/INCO.1997.2687MaRDI QIDQ1383161zbMATH OpenOpenAlexFDO

Authors Endre Boros, Toshihide Ibaraki, Kazuhisa Makino

Publication date 27 July 1998

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/b369bc48e61fac028d4532180d972b22dad1c59b

zbMATH Keywords

NP-hardnessinductionpolynomial algorithmslearning from examplespartially defined Boolean functionsminimum error extension

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30)

Recommendations

• Logical analysis of binary data with missing bits
• scientific article; zbMATH DE number 1560340
• scientific article; zbMATH DE number 1436990

Cites work

• scientific article; zbMATH DE number 4164874 (Why is no real title available?)
• scientific article; zbMATH DE number 49085 (Why is no real title available?)
• scientific article; zbMATH DE number 53984 (Why is no real title available?)
• scientific article; zbMATH DE number 3598234 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1354130 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 3231693 (Why is no real title available?)
• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• A theory of the learnable
• Complexity of identification and dualization of positive Boolean functions
• Computational limitations on learning from examples
• Decomposability of partially defined Boolean functions
• On Learning Ring-Sum-Expansions
• Predicting Cause-Effect Relationships from Incomplete Discrete Observations
• Queries and concept learning
• Structure identification in relational data
• The complexity and approximability of finding maximum feasible subsystems of linear relations
• The decision problem for some classes of sentences without quantifiers

Cited in

(25)

• Variations on extending partially defined Boolean functions with missing bits.
• Interior and exterior functions of positive Boolean functions.
• Bidual Horn functions and extensions
• Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
• Extendable local partial clones
• The Complexity of Partial Function Extension for Coverage Functions
• An efficient top-down search algorithm for learning Boolean networks of gene expression
• Decision lists and related Boolean functions
• Logical analysis of data -- the vision of Peter L. Hammer
• scientific article; zbMATH DE number 7765404 (Why is no real title available?)
• scientific article; zbMATH DE number 5174795 (Why is no real title available?)
• Logical analysis of data: classification with justification
• Logical analysis of numerical data
• Analysing DNA microarray data using Boolean techniques
• Logical analysis of binary data with missing bits
• Optimization problems in extension matrices
• scientific article; zbMATH DE number 1560340 (Why is no real title available?)
• Positive and Horn decomposability of partially defined Boolean functions
• Recognition of interval Boolean functions
• Boolean analysis of incomplete examples
• Inner-core and outer-core functions of partially defined Boolean functions
• Pareto-optimal patterns in logical analysis of data
• Double Horn functions
• Logical analysis of data with decomposable structures.
• A decomposability index in logical analysis of data

This page was built for publication: Error-free and best-fit extensions of partially defined Boolean functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383161)