Error-free and best-fit extensions of partially defined Boolean functions
DOI10.1006/INCO.1997.2687zbMATH Open0892.68091OpenAlexW2026480866MaRDI QIDQ1383161FDOQ1383161
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
Recommendations
NP-hardnessinductionpolynomial algorithmslearning from examplespartially defined Boolean functionsminimum error extension
Learning and adaptive systems in artificial intelligence (68T05) Analysis of algorithms and problem complexity (68Q25) Boolean functions (06E30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Queries and concept learning
- Title not available (Why is that?)
- Title not available (Why is that?)
- A theory of the learnable
- Title not available (Why is that?)
- The decision problem for some classes of sentences without quantifiers
- Computational limitations on learning from examples
- Title not available (Why is that?)
- The complexity and approximability of finding maximum feasible subsystems of linear relations
- Title not available (Why is that?)
- Structure identification in relational data
- Title not available (Why is that?)
- Complexity of identification and dualization of positive Boolean functions
- Title not available (Why is that?)
- Decomposability of partially defined Boolean functions
- On Learning Ring-Sum-Expansions
- Predicting Cause-Effect Relationships from Incomplete Discrete Observations
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
- Decision lists and related Boolean functions
- An efficient top-down search algorithm for learning Boolean networks of gene expression
- Logical analysis of data -- the vision of Peter L. Hammer
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Boolean analysis of incomplete examples
- Positive and Horn decomposability of partially defined Boolean functions
- Recognition of interval Boolean functions
- 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)
