{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T22:31:56Z","timestamp":1791930716718,"version":"4.3.4"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"11","license":[{"start":{"date-parts":[[2015,10,23]],"date-time":"2015-10-23T00:00:00Z","timestamp":1445558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2015,10,23]]},"abstract":"<jats:p>Inductive programming can liberate users from performing tedious and repetitive tasks.<\/jats:p>","DOI":"10.1145\/2736282","type":"journal-article","created":{"date-parts":[[2015,10,24]],"date-time":"2015-10-24T18:27:12Z","timestamp":1445711232000},"page":"90-99","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":87,"title":["Inductive programming meets the real world"],"prefix":"10.1145","volume":"58","author":[{"given":"Sumit","family":"Gulwani","sequence":"first","affiliation":[{"name":"Microsoft Corp., Redmond, WA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9","family":"Hern\u00e1ndez-Orallo","sequence":"additional","affiliation":[{"name":"Universitat Polit\u00e8cnica de Val\u00e8ncia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emanuel","family":"Kitzelmann","sequence":"additional","affiliation":[{"name":"Adam-Josef-C\u00fcppers Commercial College, Ratingen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen H.","family":"Muggleton","sequence":"additional","affiliation":[{"name":"Imperial College London, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ute","family":"Schmid","sequence":"additional","affiliation":[{"name":"University of Bamberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin","family":"Zorn","sequence":"additional","affiliation":[{"name":"Microsoft Research in Redmond, WA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,10,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.50"},{"key":"e_1_2_1_2_1","volume-title":"Using the convertfrom-string cmdlet to parse structured text. PowerShell Magazine, (Sept. 9","author":"Bielawski B.","year":"2004","unstructured":"Bielawski , B. Using the convertfrom-string cmdlet to parse structured text. PowerShell Magazine, (Sept. 9 , 2004 ); http:\/\/www.powershellmagazine.com\/2014\/09\/09\/using-the-convertfrom-string-cmdlet-to-parse-structured-text\/ Bielawski, B. Using the convertfrom-string cmdlet to parse structured text. PowerShell Magazine, (Sept. 9, 2004); http:\/\/www.powershellmagazine.com\/2014\/09\/09\/using-the-convertfrom-string-cmdlet-to-parse-structured-text\/"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2898607.2898816"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1541880.1541882"},{"key":"e_1_2_1_5_1","volume-title":"Watch What I Do: Programming by Demonstration","author":"Cypher A.","year":"1993","unstructured":"Cypher , A. ( Ed ). Watch What I Do: Programming by Demonstration . MIT Press , Cambridge, MA , 1993 . Cypher, A. (Ed). Watch What I Do: Programming by Demonstration. MIT Press, Cambridge, MA, 1993."},{"key":"e_1_2_1_6_1","first-page":"247","article-title":"Incremental learning of functional logic programs","volume":"233","author":"Ferri-Ram\u00edrez C.","year":"2001","unstructured":"Ferri-Ram\u00edrez , C. , Hern\u00e1ndez-Orallo , J. and Ram\u00edrez-Quintana , M.J . Incremental learning of functional logic programs . In Proceedings of FLOPS , 2001 , 233 -- 247 . Ferri-Ram\u00edrez, C., Hern\u00e1ndez-Orallo, J. and Ram\u00edrez-Quintana, M.J. Incremental learning of functional logic programs. In Proceedings of FLOPS, 2001, 233--247.","journal-title":"Proceedings of FLOPS"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-009-9108-7"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1836089.1836091"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926423"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2634273"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2240236.2240260"},{"key":"e_1_2_1_12_1","volume-title":"Latest Advances in Inductive Logic Programming","author":"Henderson R.J.","year":"2012","unstructured":"Henderson , R.J. and Muggleton , S.H . Automatic invention of functional abstractions . Latest Advances in Inductive Logic Programming , 2012 . Henderson, R.J. and Muggleton, S.H. Automatic invention of functional abstractions. Latest Advances in Inductive Logic Programming, 2012."},{"key":"e_1_2_1_13_1","first-page":"13502","article-title":"Inductive programming as an answer","author":"Hern\u00e1ndez-Orallo J.","year":"2013","unstructured":"Hern\u00e1ndez-Orallo , J. Deep knowledge : Inductive programming as an answer , Dagstuhl TR 13502 , 2013 . Hern\u00e1ndez-Orallo, J. Deep knowledge: Inductive programming as an answer, Dagstuhl TR 13502, 2013.","journal-title":"Dagstuhl TR"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706356.1706375"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806799.1806833"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89197-0_21"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00515-2_7"},{"key":"e_1_2_1_18_1","first-page":"73","article-title":"A survey of program synthesis techniques. In AAIP","volume":"50","author":"Kitzelmann E.","year":"2010","unstructured":"Kitzelmann , E. Inductive programming : A survey of program synthesis techniques. In AAIP , Springer , 2010 , 50 -- 73 . Kitzelmann, E. Inductive programming: A survey of program synthesis techniques. In AAIP, Springer, 2010, 50--73.","journal-title":"Springer"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248547.1248562"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0010-0285(85)90009-X"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v30i4.2262"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025671410623"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594333"},{"key":"e_1_2_1_24_1","volume-title":"Morgan Kaufmann","author":"Lieberman H.","year":"2001","unstructured":"Lieberman , H. ( Ed ). Your Wish is My Command: Programming by Example . Morgan Kaufmann , 2001 . Lieberman, H. (Ed). Your Wish is My Command: Programming by Example. Morgan Kaufmann, 2001."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of ECAI","author":"Lin D.","year":"2014","unstructured":"Lin , D. , Dechter , E. , Ellis , K. , Tenenbaum , J.B. and Muggleton , S.H . Bias reformulation for one-shot function induction . In Proceedings of ECAI , 2014 . Lin, D., Dechter, E., Ellis, K., Tenenbaum, J.B. and Muggleton, S.H. Bias reformulation for one-shot function induction. In Proceedings of ECAI, 2014."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1187.001.0001"},{"key":"e_1_2_1_27_1","volume-title":"On the definition of a general learning system with user-defined operators. arXiv preprint arXiv:1311.4235","author":"Mart\u00ecnez-Plumed C.","year":"2013","unstructured":"Mart\u00ecnez-Plumed , C. Ferri , Hern\u00e1ndez-Orallo, J. and M.J. Ram\u00edrez-Quintana . On the definition of a general learning system with user-defined operators. arXiv preprint arXiv:1311.4235 , 2013 . Mart\u00ecnez-Plumed, C. Ferri, Hern\u00e1ndez-Orallo, J. and M.J. Ram\u00edrez-Quintana. On the definition of a general learning system with user-defined operators. arXiv preprint arXiv:1311.4235, 2013."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the ICML","author":"Menon A.","year":"2013","unstructured":"Menon , A. , Tamuz , O. , Gulwani , S. , Lampson , B. and Kalai , A . A machine learning framework for programming by example . In Proceedings of the ICML , 2013 . Menon, A., Tamuz, O., Gulwani, S., Lampson, B. and Kalai, A. A machine learning framework for programming by example. In Proceedings of the ICML, 2013."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/502716.502734"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037089"},{"key":"e_1_2_1_31_1","volume-title":"IJCAI","author":"Muggleton S.H.","year":"2013","unstructured":"Muggleton , S.H. and Lin , D . Meta-interpretive learning of higher-order dyadic datalog: Predicate invention revisited . IJCAI 2013 , 1551--1557. Muggleton, S.H. and Lin, D. Meta-interpretive learning of higher-order dyadic datalog: Predicate invention revisited. IJCAI 2013, 1551--1557."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5358-3"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-011-5259-2"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00042-Y"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594297"},{"key":"e_1_2_1_36_1","volume-title":"AAAI","author":"Raza M.","year":"2014","unstructured":"Raza , M. , Gulwani , S. and Milic-Frayling , N . Programming by example using least general generalizations . AAAI , 2014 . Raza, M., Gulwani, S. and Milic-Frayling, N. Programming by example using least general generalizations. AAAI, 2014."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cogsys.2010.12.002"},{"key":"e_1_2_1_38_1","first-page":"214","article-title":"Induction of recursive program schemes","volume":"1398","author":"Schmid U.","unstructured":"Schmid , U. and Wysotzki , F . Induction of recursive program schemes . ECML 1398 LNAI (1998), 214 -- 225 . Schmid, U. and Wysotzki, F. Induction of recursive program schemes. ECML 1398 LNAI (1998), 214--225.","journal-title":"ECML"},{"key":"e_1_2_1_39_1","volume-title":"An algorithm that infers theories from facts. IJCAI","author":"Shapiro E.Y.","year":"1981","unstructured":"Shapiro , E.Y. An algorithm that infers theories from facts. IJCAI ( 1981 ), 446--451. Shapiro, E.Y. An algorithm that infers theories from facts. IJCAI (1981), 446--451."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.322002"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tics.2006.05.009"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.935874"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736282","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2736282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:30Z","timestamp":1750227150000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,23]]},"references-count":42,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2015,10,23]]}},"alternative-id":["10.1145\/2736282"],"URL":"https:\/\/doi.org\/10.1145\/2736282","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,23]]},"assertion":[{"value":"2015-10-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}