On the minimum number of logical clauses inferred from examples

DOI10.1016/0305-0548(95)00075-5zbMath0865.68099OpenAlexW2056218787MaRDI QIDQ1919787

Evangelos Triantaphyllou, Allen L. Soyster

Publication date: 30 October 1996

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

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

zbMATH Keywords

learningcomputational experimentsinductive inferencedisjunctive normal formconjunctive normal formBoolean expressionlower bound on the number of clausesrejectability graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Learning and adaptive systems in artificial intelligence (68T05) Classical propositional logic (03B05)

Related Items (1)

Logic classification and feature selection for biomedical data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A continuous approach to inductive inference
• Computational experience with an interior point algorithm on the satisfiability problem
• Finding maximum cliques in arbitrary and in special graphs
• Modeling and integer programming techniques applied to propositional calculus
• An exact algorithm for the maximum clique problem
• 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
• A fast algorithm for the maximum weight clique problem
• The maximum clique problem
• Generating logical expressions from positive and negative examples via a branch-and-bound approach
• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
• Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
• A theory of the learnable
• Computational limitations on learning from examples
• A Relationship Between CNF and DNF Systems Derivable from Examples
• A branch and bound algorithm for the maximum clique problem
• A branch and bound algorithm for the maximum clique problem

This page was built for publication: On the minimum number of logical clauses inferred from examples