Incorporating hypothetical knowledge into the process of inductive synthesis

  • Jānis Bārzdiņš
  • Ugis Sarkans
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1160)


The problem of inductive inference of functions from hypothetical knowledge is investigated in this paper. This type of inductive inference could be regarded as a generalization of synthesis from examples that can be directed not only by input/output examples but also by knowledge of, e. g., functional description's syntactic structure or assumptions about the process of function evaluation. We show that synthesis of this kind is possible by efficiently enumerating the hypothesis space and illustrate it with several examples.


Setup Time Inference Tree Inductive Inference Functional Description Condition Predicate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. Langley, G. Bradshaw, H.A. Simon. Rediscovering chemistry with the BACON system. In Machine Learning: An Artificial Intelligence Approach, R.S. Michalski, J.G. Carbonell, T.M. Mitchell (eds.), Tioga Press, Palo Alto, CA, 1983.Google Scholar
  2. 2.
    P. Langley, H.A. Simon, G. Bradshaw. Heuristics for Empirical Discovery. In Computational Models of Learning, L. Bolc (ed.), Springer-Verlag, 1987.Google Scholar
  3. 3.
    J.H. Holland. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. MIT Press, 1992.Google Scholar
  4. 4.
    J.R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992.Google Scholar
  5. 5.
    J.R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, 1994.Google Scholar
  6. 6.
    J.M. Barzdin and G.J. Barzdin. Rapid construction of algebraic axioms from samples. Theoretical Computer Science 90. 1991. pp. 199–208.CrossRefGoogle Scholar
  7. 7.
    J. Barzdins, G. Barzdins, K. Apsitis, U. Sarkans. Towards Efficient Inductive Synthesis of Expressions from input/output Examples. Lecture Notes in Artificial Intelligence, vol. 744.-1993. pp. 59–72.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Jānis Bārzdiņš
    • 1
  • Ugis Sarkans
    • 1
  1. 1.Institute of Mathematics and Computer ScienceUniversity of LatviaRigaLatvia

Personalised recommendations