Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach

DOI10.1007/BF01097004zbMath0820.90075MaRDI QIDQ1330807

Evangelos Triantaphyllou

Publication date: 11 August 1994

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

artificial intelligenceinductive inferencemaximum cliquebranch- and-boundclause satisfiability problemidentifying a hidden Boolean functionKarmakar's interior point method

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (6)

Identifying the interacting positions of a protein using Boolean learning and support vector machines ⋮ An approach to guided learning of Boolean functions ⋮ On the minimum number of logical clauses inferred from examples ⋮ An incremental learning algorithm for constructing Boolean functions from positive and negative examples ⋮ A heuristic for mining association rules in polynomial time. ⋮ A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions

Cites Work

• Unnamed Item
• Unnamed Item
• A continuous approach to inductive inference
• Computational experience with an interior point algorithm on the satisfiability problem
• Modeling and integer programming techniques applied to propositional calculus
• An exact algorithm for the maximum clique problem
• Resolution vs. cutting plane solution of inference problems: Some computational experience
• Some results and experiments in programming techniques for propositional logic
• An interior point algorithm to solve computationally difficult set covering problems
• Logic-based decision support. Mixed integer model formulation
• Generating logical expressions from positive and negative examples via a branch-and-bound approach
• A theory of the learnable
• Computational limitations on learning from examples
• A Relationship Between CNF and DNF Systems Derivable from Examples
• A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table

This page was built for publication: Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach