Abstract
We have examined, in some more detail, inference via queries restricted to a fixed number of mind changes as well as inference via queries where the finally synthesized programs may have anomalies. Thereby we could show that even questions involving only one type of quantifier may aid the learning process in two directions. First, the number of mind changes can be reduced, and second, more function classes become inferrible. On the other hand, the Theorems 6 and 15 show that the learning potential of QIMs does mainly depend on the complexity of the allowed questions measured in the number of involved quantifiers.
(Extended Abstract)
The results were obtained during the author's visit of the computing centre of the Latvian State University.
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, 2 (1987), 87–106.
Angluin, D., Learning k-term DNF formulas using queries and counter-examples. Dept. of Computer Science TR-559, Yale Univ., New Haven, CT, 1987.
Angluin, D., Queries and concept learning. Machine learning 2 (1988), 319–342.
Angluin, D., Learning with hints. Proc. First Workshop on Computational Learning Theory, Aug. 3–5. MIT, pp. 223–237.
Angluin, D.,and C.H. Smith, Inductive inference: theory and methods. Computing Surveys 15 (1983), 237–269.
Angluin, D.,and C.H. Smith, Inductive inference. In Encyclopedia of Artificial Intelligence, S. Shapiro, Ed., 1987.
Barzdin, Ya. M., Two theorems on the limiting synthesis of functions. In Theory of Algorithms and Programs I, (Ya. M. Barzdin, Ed.), pp. 82–88 (in russian), Latvian State Univ., 1974.
Case, J., and C.H. Smith, Comparison of identification criteria for machine inductive inference. Theoretical Computer Science 25, 2 (1983), 193–220.
Gasarch, W.I., and C.H. Smith, Learning via queries. Univ. of Maryland, Institute for Advanced Computer Studies, Dept. of Computer Science, TR-88-89.
Klette, R., and R. Wiehagen, Research in the theory of inductive inference by GDR-mathematiciens — a survey. Information Science 22, 149–169.
Osherson, D., Stob, M, and S. Weinstein, Systems that Learn. (MIT Press, Cambridge, MA 1986).
Rogers, H. Jr., Theory of Recursive Functions and Effective Computability. (McGraw-Hill, New York 1967).
Smith, C.H., The power of pluralism for automatic program synthesis., Journal of the ACM 29, 4 (1982), 1144–1165.
Smullyan, R.M., Theory of formal systems. Annals of Mathematical Studies 42, 7, (1962).
Wiehagen, R., Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. Journal Inf. Processing and Cybernetics (EIK) 12 (1976), 1/2, 93–99.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kinber, E.B., Zeugmann, T. (1989). Refined query inference. In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1989. Lecture Notes in Computer Science, vol 397. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51734-0_57
Download citation
DOI: https://doi.org/10.1007/3-540-51734-0_57
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51734-4
Online ISBN: 978-3-540-46798-4
eBook Packages: Springer Book Archive