{"type":"ScholarlyArticle","title":"Automatic Program Synthesis from Example Problems","authors":[{"name":"Laurent Siklóssy","slug":"laurent-siklossy","given":"Laurent","family":"Siklóssy","affiliation":""},{"name":"D. A. Sykas","slug":"d-a-sykas","given":"D. A.","family":"Sykas","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1975/41","pdf":"https://ijcai.org/proceedings/1975/0041.pdf","markdown":"https://ijcai.org/proceedings/1975/41.md","bibtex":"https://ijcai.org/proceedings/1975/bibtex/41","volume":{"slug":"1975","title":"Proceedings of the Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1975","url":"https://ijcai.org/proceedings/1975/","year":1975,"location":"Tbilisi, Georgia, USSR","dates":"","editors":"Patrick Winston and Carl Hewitt","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Learning Debugging And Automatic Programming","track":"Learning Debugging And Automatic Programming","number":41,"pages":{"first":268,"last":272},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}