Exact learning via the Monotone theory

We study the learnability of concept classes from membership and equivalence queries. We develop the Monotone theory that proves (1) Any boolean function is learnable as decision tree. (2) Any boolean function is either learnable as DNF or as CNF (or both). The first result solves the open problem of the learnability of decision trees and the second result gives more evidence that DNFs are not "very hard" to learn.<
>