Abstract
In this paper we give a MAT(Minimally Adequate Teacher) learning algorithm of multilinear logic programs. MAT learning is to infer the unknown model M U that the teacher has, with membership queries and equivalence queries. In the class of multilinear programs, we show some programs which have not been proved to be MAT learnable previously. If a multilinear program P U represents M U that the teacher has, then the total running time of our learning algorithm is bounded by a polynomial in m, w and h, where m is the number of predicates in P U , h is the number of non-linear clauses in P U , and w is a parameter depending on counter-examples to equivalence queries. We also show multilinear programs with outputs are MAT learnable by extending the algorithm.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Learning regular sets from queries and counter-examples, Information and Computation, 75:87–106, 1987.
Brainerd, W.S.: The Minimalization of Tree Automata, Information and Control, 13:483–491, 1968.
Ishizaka, H.: Learning Simple Deterministic Languages, in Proceedings of the Second Annual Workshop on Computional Learning Theory:162–174, 1989.
Ito, K.: Logic Programs which are MAT Learnable, Graduation Thesis, Faculty of Engineering, Hokkaido University, 1992.
Lloyd, J. W.: Foundations of Logic Programming, Springer-Verlag,1984.
Marque-Pucheu, G.: Rational Set of Trees and the Algebraic Semantics of Logic Programming, Acta Informatica, 20:249–260, 1983.
Muggleton, S.: Inductive Logic Programming, in Proceedings of the First International Workshop on Algorithmic Learning Theory:42–62, 1990.
Sakakibara, Y.: Learning Context-free Grammars from Structural Data in Polynomial Time, in Proceedings of 1st Workshop on Computational Learning Theory:296–310, 1988.
Sakakibara, Y.: Inductive Inference of Logic Programs Based on Algebraic Semantics, New Generation Computing, 7: 365–380, 1990.
Sakakibara, Y., Nishino, T.: EXACT Learning — Concept Learning from Queries (in Japanese), Journal of Information Processing Society Japan, 32:246–255, 1991.
Shapiro, E. Y.: Inductive Inference of Theories from Facts, Technical Report, 192, Yale University Computer Science Dept. 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ito, K., Yamamoto, A. (1993). Polynomial-time MAT learning of multilinear logic programs. In: Doshita, S., Furukawa, K., Jantke, K.P., Nishida, T. (eds) Algorithmic Learning Theory. ALT 1992. Lecture Notes in Computer Science, vol 743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57369-0_28
Download citation
DOI: https://doi.org/10.1007/3-540-57369-0_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57369-2
Online ISBN: 978-3-540-48093-8
eBook Packages: Springer Book Archive