A Relationship Between CNF and DNF Systems Derivable from Examples

DOI10.1287/IJOC.7.3.283MaRDI QIDQ4896432zbMATH OpenOpenAlexFDO

Authors Evangelos Triantaphyllou, Allen L. Soyster

Publication date 20 October 1996

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/686ba6865da17d76220eb45e0d5d72db26afa364

zbMATH Keywords

disjunctive normal formconjunctive normal formDNF algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• On the learnability of disjunctive normal form formulas
• scientific article; zbMATH DE number 4092808
• On the minimum number of logical clauses inferred from examples
• Learning Boolean formulas

Cited in

(9)

• On the minimum number of logical clauses inferred from examples
• A heuristic for mining association rules in polynomial time.
• 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
• 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
• An incremental learning algorithm for constructing Boolean functions from positive and negative examples
• Mathematical Foundations of Computer Science 2003
• On converting CNF to DNF

This page was built for publication: A Relationship Between CNF and DNF Systems Derivable from Examples

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