Abstract
In this article, PAC-learning theory is applied to model inference, which concerns the problem of inferring theories from facts in first order logic. It is argued that uniform sample PAC-learnability cannot be expected with most of the ‘interesting’ model classes. Polynomial sample learnability can only be accomplished in classes of programs having a fixed maximum number of clauses. We have proved that the class of context free programs in a fixed maximum number of clauses with a fixed maximum number of literals is learnable from a polynomial number of examples. This is also proved for a more general class of programs.
Chapter PDF
Similar content being viewed by others
References
Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.: Learnability and the Vapnik-Chervonenkis Dimension. Journal of the Association for Computing Machinery 36 No. 4 (1989) 929–965
Cohen, W.: Learnability of Restricted Logic Programs. Proceedings of the Third International Workshop on Inductive Logic Programming (ILP'93) (1993) 41–71
Cohen, W.: PAC-Learning a restricted Class of recursive Logic Programs. Proceedings of the Third International Workshop on Inductive Logic Programming (ILP'93) (1993) 73–86
Dzeroski, S., Muggleton, S., Russel, S.: PAC-Leamability of Determinate Logic Programs. Proceedings of the Fifth ACM Workshop on Computational Learning Theory (1992) 128–135
Dzeroski, S., Muggleton, S., Russel, S.: Learnability of Constrained Logic Programs. Proceedings of ECML'93 (1993) 342–347
Ehrenfeucht, A., Haussler, D., Kearns, M., Valiant, L.: A General Lower Bound on the Number of Examples Needed for Learning. Information and Computation 82 (1989) 247–261
Kietz, J.: Some Lower Bounds for the Computational Complexity of Inductive Logic Programming. Proceedings of ECML'93 (1993) 114–123
Ling, X.: Inductive Learning from Good Examples. Proceedings of IJCAP91 (1991) 751–756
Muggleton, S.: Inductive Logic Programming. Muggleton S. (ed.), Inductive Logic Programming, Academic Press (1992) 3–27
Natarajan, B.: Machine Learning, a Theoretical Approach. Morgan Kaufman Publishers, Inc (1991)
Page, C.D., and Frish, A.M.: Generalization and Learnability: A study of Constrained Atoms. Muggleton (ed.), Inductive Logic Programming, Academic Press (1992) 29–61
Polman, M., Nienhuys-Cheng, S.-H.: PAC-Learning and Model Inference. Benelearn'93, Collection of work reports, Vrije Universiteit Brussel (1993)
Reynolds, J.C.: Transformational Systems and the Algebraic Structure of Atomic Formulas. Machine Intelligence 5 (1970) 135–153
Shapiro, E.: Inductive Inference of Theories from Facts. Technical Report 192, Dept. of Computer Science, Yale University, USA (1981)
Valiant, L.G.: A Theory of the Learnable. Communications of the ACM 27 No. 11 (1984) 1134–1142
Vapnik, V., and Chervonenkis, A.: On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications 16 No. 2 (1971) 264–280
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nienhuys-Cheng, S.H., Polman, M. (1994). Sample PAC-learnability in model inference. In: Bergadano, F., De Raedt, L. (eds) Machine Learning: ECML-94. ECML 1994. Lecture Notes in Computer Science, vol 784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57868-4_60
Download citation
DOI: https://doi.org/10.1007/3-540-57868-4_60
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57868-0
Online ISBN: 978-3-540-48365-6
eBook Packages: Springer Book Archive