Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Analogical program synthesis from program components

  • Program Synthesis
  • Conference paper
  • First Online:
Logic Programming '87 (LP 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 315))

Included in the following conference series:

  • 126 Accesses

Abstract

In this paper, we defined the notion of similarity between components, and presented a method for both selecting necessary program components and discovering vacant ones. To verify our concept, the prototype system called ‘APSS’ was constructed. In this system, we have already included some other similarities not presented in this paper. For example, we consider that a program component for retrieving the largest number from some numerical data set is similar to the one for retrieving the largest three numbers. These two components are similar since they are both containing a process which retrieves an element and compare it with all other elements in the same data set. This type of similarity can be defined using some mathematical definition of numerical elements. We will discuss these similarity relations in the forthcoming paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • Carbonell JG (1983) Learning by analogy: Formulating and generating plans from past experience. In: Ryszard S et al.(eds.), Machine Learning, Morgan Kaufmann, pp.137–161

    Google Scholar 

  • Elliot S (1985) Learning to Program=Learning to Construct Mechanisms and Explanations. Communications of ACM, 29-9, pp.850–858

    Google Scholar 

  • Haraguchi M, Arikawa S (1985) Analogical Reasoning using Transformations of rules. In: Wada E (ed) Logic Programming '85. Springer, Berlin Heidelberg New York, pp.56–65

    Google Scholar 

  • Uehara K, Fujii K, Toyoda J (1986) A Technique for Prolog Program Synthesis from Natural Language Specification. Computer software, 3–4, pp.55–64

    Google Scholar 

  • Winston PH, Binford TO, Katz B, Lowry M (1983) Learning Physical Descriptions from Functional Definitions, Examples, and Precedents. Proc. of AAAI-83, pp.433–439

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Institute of Scientific and Industrial Research, Osaka University, 567, Ibaraki, Japan

    Takeshi Imanaka, Kuniaki Uehara & Jun'ichi Toyoda

Authors
  1. Takeshi Imanaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kuniaki Uehara
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jun'ichi Toyoda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Koichi Furukawa Hozumi Tanaka Tetsunosuke Fujisaki

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Imanaka, T., Uehara, K., Toyoda, J. (1988). Analogical program synthesis from program components. 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_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-19426-6_5

  • 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

Publish with us

Policies and ethics

Search

Navigation