Automatic Program Synthesis from Example Problems

Siklóssy, Laurent; Sykas, D. A.

Automatic Program Synthesis from Example Problems

Download BibTeX Cite

Proceedings of the Fourth International Joint Conference on Artificial Intelligence. Learning Debugging And Automatic Programming. Pages 268-272.

Abstract

Desired algorithms to be synthesized are described implicitly by example problems that the algorithms should solve. The example problems are first solved by the probl~olver LAWALY. The obtained solution represents a trace of the desired algorithm. From the trace, the algorithm is synthesized by the synthesizer SYN. SYN writes recursive programs with repeat statements, and generates its own subroutines. Examples of functions synthesized include repetitive robot tasks and tree traversal algorithms.

Laurent Siklóssy, and D. A. Sykas. 1975. Automatic Program Synthesis from Example Problems. In Proceedings of the Fourth International Joint Conference on Artificial Intelligence, IJCAI-75. IJCAI, 268–272. https://ijcai.org/proceedings/1975/41

@inproceedings{ijcai1975p41,
  title     = {Automatic Program Synthesis from Example Problems},
  author    = {Siklóssy, Laurent and Sykas, D. A.},
  booktitle = {Proceedings of the Fourth International Joint Conference on
               Artificial Intelligence, {IJCAI-75}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Patrick Winston and Carl Hewitt},
  pages     = {268--272},
  year      = {1975},
  note      = {Learning Debugging And Automatic Programming},
  url       = {https://ijcai.org/proceedings/1975/41},
}

TY  - CPAPER
TI  - Automatic Program Synthesis from Example Problems
AU  - Siklóssy, Laurent
AU  - Sykas, D. A.
T2  - Proceedings of the Fourth International Joint Conference on Artificial Intelligence, IJCAI-75
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1975
SP  - 268
EP  - 272
UR  - https://ijcai.org/proceedings/1975/41
ER  -