Generating logical expressions from positive and negative examples via a branch-and-bound approach

DOI10.1016/0305-0548(94)90051-5zbMath0798.90133OpenAlexW1994109348MaRDI QIDQ1318514

Soundar R. T. Kumara, Evangelos Triantaphyllou, Allen L. Soyster

Publication date: 26 April 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90051-5

zbMATH Keywords

branch-and-boundlogical system

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (7)

Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach ⋮ 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 continuous approach to inductive inference ⋮ A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions

Cites Work

• Computational experience with an interior point algorithm on the satisfiability problem
• Modeling and integer programming techniques applied to propositional calculus
• Resolution vs. cutting plane solution of inference problems: Some computational experience
• Some results and experiments in programming techniques for propositional logic
• An approach to guided learning of Boolean functions
• A theory of the learnable
• Computational limitations on learning from examples
• A Relationship Between CNF and DNF Systems Derivable from Examples

This page was built for publication: Generating logical expressions from positive and negative examples via a branch-and-bound approach