Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
type: Item
instance of: scholarly article
title: Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
zbMATH Open document ID: 0820.90075
DOI: 10.1007/BF01097004
author: Evangelos Triantaphyllou
published in: Journal of Global Optimization
publication date: 1994-08-11T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 617063
zbMATH Keywords: inductive inference
zbMATH Keywords: clause satisfiability problem
zbMATH Keywords: maximum clique
zbMATH Keywords: identifying a hidden Boolean function
zbMATH Keywords: artificial intelligence
zbMATH Keywords: branch- and-bound
zbMATH Keywords: Karmakar's interior point method
MaRDI profile type: Publication
cites work: Q5604990
cites work: Q3680754
cites work: Some results and experiments in programming techniques for propositional logic
cites work: An exact algorithm for the maximum clique problem
cites work: Modeling and integer programming techniques applied to propositional calculus
cites work: A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
cites work: Resolution vs. cutting plane solution of inference problems: Some computational experience
cites work: Logic-based decision support. Mixed integer model formulation
cites work: Computational experience with an interior point algorithm on the satisfiability problem
cites work: A continuous approach to inductive inference
cites work: An interior point algorithm to solve computationally difficult set covering problems
cites work: Computational limitations on learning from examples
cites work: Generating logical expressions from positive and negative examples via a branch-and-bound approach
cites work: A Relationship Between CNF and DNF Systems Derivable from Examples
cites work: A theory of the learnable
description: scientific article; zbMATH DE number 617063