On the learnability of disjunctive normal form formulas

MaRDI QIDQ1900981zbMATH OpenFDO

Authors Howard Aizenstein, Leonard Pitt

Publication date 29 October 1995

Published in Machine Learning (Search for Journal in Brave)

zbMATH Keywords

greedy heuristicdisjunctive normal formlearnability

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 4092808
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• On learning random DNF formulas under the uniform distribution
• scientific article; zbMATH DE number 1256728
• Learning Boolean formulas

Cited in

(16)

• Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
• Molecular Learning of wDNF Formulae
• Grafting for combinatorial binary model using frequent itemset mining
• A new abstract combinatorial dimension for exact learning via queries
• Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
• Projective DNF formulae and their revision.
• Proper learning of \(k\)-term DNF formulas from satisfying assignments
• SAT-based invariant inference and its relation to concept learning
• Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows”
• On using the Fourier transform to learn disjoint DNF
• Learning random monotone DNF
• An approximately fast algorithm for deciding the validity of disjunctive normal forms (DNFs)
• scientific article; zbMATH DE number 4092808 (Why is no real title available?)
• Version spaces and the consistency problem
• On the limits of proper learnability of subclasses of DNF formulas
• Learning DNF in time

This page was built for publication: On the learnability of disjunctive normal form formulas

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