Characterization of a Class of Functions Synthesized from Examples by a SUMMERS like Method Using a "B.M.W." Matching Technique
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.
Cite
Text
Jouannaud and Kodratoff. "Characterization of a Class of Functions Synthesized from Examples by a SUMMERS like Method Using a "B.M.W." Matching Technique." International Joint Conference on Artificial Intelligence, 1979.Markdown
[Jouannaud and Kodratoff. "Characterization of a Class of Functions Synthesized from Examples by a SUMMERS like Method Using a "B.M.W." Matching Technique." International Joint Conference on Artificial Intelligence, 1979.](https://mlanthology.org/ijcai/1979/jouannaud1979ijcai-characterization/)BibTeX
@inproceedings{jouannaud1979ijcai-characterization,
title = {{Characterization of a Class of Functions Synthesized from Examples by a SUMMERS like Method Using a "B.M.W." Matching Technique}},
author = {Jouannaud, Jean-Pierre and Kodratoff, Yves},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1979},
pages = {440-447},
url = {https://mlanthology.org/ijcai/1979/jouannaud1979ijcai-characterization/}
}