PAC-learning logic programs under the closed world assumption

© Springer-Verlag Berlin Heidelberg 1996. Positive PAC-learning results are presented for the normal inductive logic programming setting. In our formalisation of this setting, examples are complete models of the target theory, which corresponds to making the closed world assumption. The results obtained here are the first PAC-learning results for ILP in the normal setting, that allow for recursive theories as well as multiple predicates.status: publishe