Question: 16.4 Learning monotone DNF formulae with queries. Show that the class of monotone DNF formulae over n variables is eciently exactly learnable using membership and
16.4 Learning monotone DNF formulae with queries. Show that the class of monotone DNF formulae over n variables is eciently exactly learnable using membership and equivalence queries. (Hint: a prime implicant t of a formula f is a product of literals such that t implies f but no proper sub-term of t implies f.
Use the fact that for monotone DNF, the number of prime implicants is at the most the number of terms of the formula.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
