Abstract
This paper is concerned with an algorithm for identifying an unknown regular language from examples of its members and non-members. The algorithm is based on the model inference algorithm given by Shapiro. In our setting, however, a given first order language for describing a target logic program has countably many unary predicate symbols: q0, q1, q2, ....On the other hand, the oracle which gives information about the unknown regular language to the inference algorithm has no interpretation for predicates other than the predicate q0. In such a setting, we cannot directly take advantage of the contradiction backtracing algorithm which is one of the most important part for the efficiency of the model inference algorithm. In order to overcome this disadvantage, we develop a method for giving an interpretation for predicates other than the predicate q0 indirectly, which is based on the idea of using the oracle and a one to one mapping from a set of predicates to a set of strings. Furthermore, we propose a model inference algorithm for regular languages using the method, then argue the correctness and the time complexity of the algorithm.
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Learning regular sets from queries and counter-examples, Technical Report 464, Yale University, Department of Computer Science, March, 1986.
Gold, E. M.: Language Identification in the Limit, Information and Control 10, 447–474, 1967.
Hopcroft, J. E., Ullman, J. D.: Formal Languages and Their Relation to Automata, Addison-Wesley, 1969.
Lloyd, J. W.: Foundations of Logic Programming, Springer-Verlag, 1984.
Shapiro, E. Y.: Inductive Inference of Theories From Facts, Technical Report 192, Yale University, Department of Computer Science, February, 1981.
Shapiro, E. Y.: Algorithmic Program Debugging, MIT Press, 1983.
Shapiro, E. Y.: Alternation and the Computational Complexity of Logic Programs, The Journal of Logic Programming 1, 19–33, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ishizaka, H. (1988). Inductive inference of regular languages based on model inference. In: Furukawa, K., Tanaka, H., Fujisaki, T. (eds) Logic Programming '87. LP 1987. Lecture Notes in Computer Science, vol 315. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19426-6_12
Download citation
DOI: https://doi.org/10.1007/3-540-19426-6_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19426-2
Online ISBN: 978-3-540-39267-5
eBook Packages: Springer Book Archive