Learning nearly monotone k-term DNF
From MaRDI portal
Recommendations
Cites work
Cited in
(15)- Learning a subclass of \(k\)-quasi-Horn formulas with membership queries
- scientific article; zbMATH DE number 1804124 (Why is no real title available?)
- The learnability of exclusive-or expansions based on monotone DNF formulas
- DKL: an efficient algorithm for learning deterministic Kripke structures
- A new abstract combinatorial dimension for exact learning via queries
- On Exact Learning Monotone DNF from Membership Queries
- The monotone theory for the PAC-model.
- 10.1162/153244303768966094
- Disjunctions of negated counting functions are efficiently learnable with equivalence queries
- Fast learning of \(k\)-term DNF formulas with queries.
- Learning Pseudo-Boolean k-DNF and Submodular Functions
- Learning Random Monotone DNF
- ILP Through Propositionalization and Stochastic k-Term DNF Learning
- Learning k-Term Monotone Boolean Formulae.
- Proper learning of \(k\)-term DNF formulas from satisfying assignments
This page was built for publication: Learning nearly monotone \(k\)-term DNF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293322)