Abstract
We consider the exact, learuability 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 learuability of read-k monotone formulas, Sat-k O(log n)-CDNF, and O(√log n)-size CDNF from membership queries only.
Cite
CITATION STYLE
Domingo, C. (1996). Exact learning of subclasses of CDNF formulas with membership queries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1090, pp. 179–188). Springer Verlag. https://doi.org/10.1007/3-540-61332-3_151
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
