16.4 Learning monotone DNF formulae with queries. Show that the class of monotone DNF formulae over n

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 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.)

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Foundations Of Machine Learning

ISBN: 9780262351362

2nd Edition

Authors: Mehryar Mohri, Afshin Rostamizadeh

Question Posted: