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