Abstract
Given several input/output examples of some function we can state the problem: what is the “simplest” function which complies with these examples. This problem is well studied and is known to be very hard in the general case. In this paper we address a special case of the problem, when the target function can be expressed as a simple composition of known functions. We propose a new inductive synthesis algorithm for this case and show that it is efficient enough to synthesize complex geometry formulas.
Preview
Unable to display preview. Download preview PDF.
References
J.M. Barzdin and G.J. Barzdins. Rapid construction of algebraic axioms from samples. Theoretical Computer Science, 90:199–208, 1991.
G. Barzdins. ADT implementation and completion by induction from examples. In 7-th Workshop on Specification of ADT (Germany, April 1990), volume 534 of Lecture Notes in Computer Science, pages 1–10, 1901.
G. Barzdins. Inductive synthesis of term rewriting systems. In D.Bjorner and J.Barzdins, editors, Baltic Computer Science, volume 502 of Lecture Notes in Computer Science, pages 253–285, 1991.
R. J. Gillings. The volume of a truncated pyramid in ancient egyptian papyri. The Mathematics Teacher, 57:552–555, 1964.
E. Howard. An Introduction to the History of Mathematics. Holt: Reinhard and Winston, New York, 1961.
B.L. Waerden. Science Awakening. P. Noordhoff LTD-Groningen, Holland, 1954.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bärzdiņš, J., Bärzdiņš, G. (1993). Towards efficient inductive synthesis: Rapid construction of local regularities. In: Brewka, G., Jantke, K.P., Schmitt, P.H. (eds) Nonmonotonic and Inductive Logic. NIL 1991. Lecture Notes in Computer Science, vol 659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030390
Download citation
DOI: https://doi.org/10.1007/BFb0030390
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56433-1
Online ISBN: 978-3-540-47557-6
eBook Packages: Springer Book Archive