Characterization of a class of functions synthesized from examples by a summers like method using a "B.M.W." matching technique

  • Authors:

  • J. P. Jouannaud;Y. Kodratoff

  • Affiliations:

  • Centre de Recherche en Informatique de Nancy, UFR de Mathematiques, Universite de Nancy I, Nancy Cedex;Institut de Progranimation, Universite Pierre et Marie Curie, Paris Cedex

  • Venue:
  • IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1979

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes first a program synthesis from examples method using a SUMMERS like methodology together with a sophisticated pattern matching technique, the BOYER-MOORE-WEGBREIT algorithm. We then characterize the class of functions synthesized from a restricted BMW algorithm. Our methodology is founded on three grounds.The first one is a precise characterization of the list domains fitting the synthesis from examples problem. The second one is SUMMERS' technique of input-output examples transformation into computational traces. The third one is the description by a restricted program scheme of the functions in the class. It seems to us that the proofs methods easily extend to the general class.