Exact learning of subclasses of CDNF formulas with membership queries [chapter]

Carlos Domingo
1996 Lecture Notes in Computer Science  
We consider the exact learnability of subclasses of Boolean formulas from membership queries alone. We show how to combine known learning algorithms that use membership and equivalence queries to obtain new learning results only with memberships. In particular we show the exact learnability of read-k monotone CDNF formulas, Satk O(log n)-CDNF, and O( p log n)-size CDNF from membership queries only.
doi:10.1007/3-540-61332-3_151 fatcat:u6a2fcl3vvc5zg72crdgw2lqjq