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

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

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

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-bound; logical system

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C10: Integer programming

68T35: Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence

Related Items

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, Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach, A heuristic for mining association rules in polynomial time., An approach to guided learning of Boolean functions, On the minimum number of logical clauses inferred from examples

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