Notes on Computational Learning Theory and the problem of learning CNFs

From International Center for Computational Logic

Notes on Computational Learning Theory and the problem of learning CNFs

Talk by Ana Ozaki
This is an informal talk where I first talk about the PAC learning model and the classical problem of learning the CNF class. Then I will present the MVDF class, which non-trivially lies between Horn and CNF, and discuss some results related to this class in the PAC learning model extended with membership queries.