On the minimum number of logical clauses inferred from examples

DOI10.1016/0305-0548(95)00075-5zbMATH Open0865.68099OpenAlexW2056218787MaRDI QIDQ1919787FDOQ1919787

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1054681
• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
• A Relationship Between CNF and DNF Systems Derivable from Examples
• Learning conjunctions of Horn clauses
• Generating logical expressions from positive and negative examples via a branch-and-bound approach

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• The maximum clique problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theory of the learnable
• Some results and experiments in programming techniques for propositional logic
• An interior point algorithm to solve computationally difficult set covering problems
• Computational limitations on learning from examples
• A fast algorithm for the maximum weight clique problem
• A branch and bound algorithm for the maximum clique problem
• An exact algorithm for the maximum clique problem
• Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
• Finding maximum cliques in arbitrary and in special graphs
• Logic-based decision support. Mixed integer model formulation
• Modeling and integer programming techniques applied to propositional calculus
• Generating logical expressions from positive and negative examples via a branch-and-bound approach
• A continuous approach to inductive inference
• Computational experience with an interior point algorithm on the satisfiability problem
• A branch and bound algorithm for the maximum clique problem
• Inference of a minimum size Boolean function from examples by using a new efficient branch-and-bound approach
• A Relationship Between CNF and DNF Systems Derivable from Examples
• Title not available (Why is that?)

Cited In (3)

• Generating logical expressions from positive and negative examples via a branch-and-bound approach
• A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions
• Logic classification and feature selection for biomedical data

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1919787)