{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T11:00:55Z","timestamp":1775818855383,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T00:00:00Z","timestamp":1292544000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["K\u00fcnstl Intell"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s13218-010-0071-x","type":"journal-article","created":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T09:35:46Z","timestamp":1292492146000},"page":"179-182","source":"Crossref","is-referenced-by-count":11,"title":["A Combined Analytical and Search-Based Approach for\u00a0the\u00a0Inductive Synthesis of Functional Programs"],"prefix":"10.1007","volume":"25","author":[{"given":"Emanuel","family":"Kitzelmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,17]]},"reference":[{"key":"71_CR1","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-44881-0_7","volume-title":"Rewriting techniques and applications (RTA\u201903)","author":"M Clavel","year":"2003","unstructured":"Clavel M, Dur\u00e1n F, Eker S, Lincoln P, Mart\u00ed-Oliet N, Meseguer J, Talcott C (2003) The maude 2.0 system. In: Rewriting techniques and applications (RTA\u201903). Lecture notes in artificial intelligence, vol\u00a02706. Springer, Berlin, pp\u00a076\u201387"},{"key":"71_CR2","volume-title":"22nd symposium on implementation and application of functional languages (IFL)","author":"M Hofmann","year":"2010","unstructured":"Hofmann M (2010) Data-driven detection of catamorphisms: Towards problem specific use of program schemes for inductive program synthesis. In: 22nd symposium on implementation and application of functional languages (IFL)"},{"key":"71_CR3","first-page":"111","volume-title":"Selected papers from the 6th symposium on trends in functional programming","author":"S Katayama","year":"2007","unstructured":"Katayama S (2007) Systematic search for lambda expressions. In: Selected papers from the 6th symposium on trends in functional programming, pp\u00a0111\u2013126. Intellect"},{"key":"71_CR4","unstructured":"Kitzelmann E (2010) A combined analytical and search-based approach to the inductive synthesis of functional programs. PhD\u00a0thesis, Fakult\u00e4t f\u00fcr Wirtschaftsinformatik und Angewandte Informatik, Otto-Friedrich Universit\u00e4t Bamberg. URL http:\/\/www.opus-bayern.de\/uni-bamberg\/volltexte\/2010\/280\/"},{"key":"71_CR5","first-page":"429","volume":"7","author":"E Kitzelmann","year":"2006","unstructured":"Kitzelmann E, Schmid U (2006) Inductive synthesis of functional programs: an explanation based generalization approach. J Mach Learn Res 7:429\u2013454","journal-title":"J Mach Learn Res"},{"issue":"1","key":"71_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0004-3702(94)00042-Y","volume":"74","author":"JR Olsson","year":"1995","unstructured":"Olsson JR (1995) Inductive functional programming using incremental program transformation. Artif Intell 74(1):55\u201383","journal-title":"Artif Intell"},{"key":"71_CR7","first-page":"153","volume":"5","author":"GD Plotkin","year":"1970","unstructured":"Plotkin GD (1970) A note on inductive generalization. Mach Intell 5:153\u2013163","journal-title":"Mach Intell"},{"key":"71_CR8","volume-title":"Lecture notes in artificial intelligence","author":"U Schmid","year":"2003","unstructured":"Schmid U (2003) Inductive synthesis of functional programs: universal planning, folding of finite programs, and schema abstraction by analogical reasoning. In Lecture notes in artificial intelligence. Springer, Berlin\/New York"},{"key":"71_CR9","first-page":"307","volume-title":"Automatic program construction techniques","author":"DR Smith","year":"1984","unstructured":"Smith DR (1984) The synthesis of LISP programs from examples: a\u00a0survey. In: Automatic program construction techniques. Macmillan, London, pp\u00a0307\u2013324"},{"key":"71_CR10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1023\/A:1022686910523","volume":"10","author":"MM Veloso","year":"1993","unstructured":"Veloso MM, Carbonell JG (1993) Derivational analogy in prodigy: automating case acquisition, storage, and utilization. Mach Learn 10:249\u2013278","journal-title":"Mach Learn"}],"container-title":["KI - K\u00fcnstliche Intelligenz"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-010-0071-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13218-010-0071-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-010-0071-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T10:59:47Z","timestamp":1559473187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13218-010-0071-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,17]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["71"],"URL":"https:\/\/doi.org\/10.1007\/s13218-010-0071-x","relation":{},"ISSN":["0933-1875","1610-1987"],"issn-type":[{"value":"0933-1875","type":"print"},{"value":"1610-1987","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,17]]}}}