{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:31:10Z","timestamp":1740123070975,"version":"3.37.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T00:00:00Z","timestamp":1679443200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T00:00:00Z","timestamp":1679443200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/V040340\/1"],"award-info":[{"award-number":["EP\/V040340\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A magic value in a program is a constant symbol that is essential for the execution of the program but has no clear explanation for its choice. Learning programs with magic values is difficult for existing program synthesis approaches. To overcome this limitation, we introduce an inductive logic programming approach to efficiently learn programs with magic values. Our experiments on diverse domains, including program synthesis, drug design, and game playing, show that our approach can (1) outperform existing approaches in terms of predictive accuracies and learning times, (2) learn magic values from infinite domains, such as the value of<jats:italic>pi<\/jats:italic>, and (3) scale to domains with millions of constant symbols.<\/jats:p>","DOI":"10.1007\/s10994-022-06274-w","type":"journal-article","created":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T20:02:31Z","timestamp":1679515351000},"page":"1551-1595","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning programs with magic values"],"prefix":"10.1007","volume":"112","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6732-1587","authenticated-orcid":false,"given":"C\u00e9line","family":"Hocquette","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Cropper","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,22]]},"reference":[{"key":"6274_CR1","doi-asserted-by":"crossref","unstructured":"Augusto, D. A., & Barbosa, H. J. (2000). Symbolic regression via genetic programming. In Proceedings. Vol. 1. Sixth Brazilian symposium on neural networks (pp. 173\u2013178). IEEE.","DOI":"10.1109\/SBRN.2000.889734"},{"key":"6274_CR2","unstructured":"Austel, V., Dash, S., Gunluk, O., Horesh, L., Liberti, L., Nannicini, G., & Schieber, B. (2017). Globally optimal symbolic regression. In Interpretable ML, satellite workshop of NIPS 2017."},{"key":"6274_CR3","unstructured":"Blockeel, H., De\u00a0Raedt, L., & Ramon, J. (1998). Top-down induction of clustering trees. In ICML."},{"key":"6274_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3540635149_36","volume-title":"Inductive Logic Programming","author":"H Blockeel","year":"1997","unstructured":"Blockeel, H., & De Raedt, L. (1997). Lookahead and discretization in ILP. In N. Lavra\u010d & S. D\u017eeroski (Eds.), Inductive Logic Programming (pp. 77\u201384). Berlin: Springer."},{"issue":"1\u20132","key":"6274_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0004-3702(98)00034-4","volume":"101","author":"H Blockeel","year":"1998","unstructured":"Blockeel, H., & De Raedt, L. (1998). Top-down induction of first-order logical decision trees. Artificial Intelligence, 101(1\u20132), 285\u2013297.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"6274_CR6","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989). Learnability and the Vapnik\u2013Chervonenkis dimension. Journal of the ACM (JACM), 36(4), 929\u2013965.","journal-title":"Journal of the ACM (JACM)"},{"key":"6274_CR7","doi-asserted-by":"crossref","unstructured":"Corapi, D., Russo, A., & Lupu, E. (2011). Inductive logic programming in answer set programming. In Inductive logic programming\u201421st international conference (pp. 91\u201397).","DOI":"10.1007\/978-3-642-31951-8_12"},{"key":"6274_CR8","doi-asserted-by":"crossref","unstructured":"Cropper, A. (2022). Learning logic programs though divide, constrain, and conquer. In Thirty-sixth AAAI conference on artificial intelligence, AAAI 2022, thirty-fourth conference on innovative applications of artificial intelligence, IAAI 2022, the twelveth symposium on educational advances in artificial intelligence, EAAI 2022 virtual event, February 22\u2013March 1, 2022 (pp. 6446\u20136453). AAAI Press. https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/20596.","DOI":"10.1609\/aaai.v36i6.20596"},{"key":"6274_CR9","unstructured":"Cropper, A., & Hocquette, C. (2022). Learning programs by combining programs. arXiv. arxiv:2206.01614."},{"key":"6274_CR10","doi-asserted-by":"crossref","unstructured":"Cropper, A., & Morel, R. (2021). Predicate invention by learning from failures. arXiv preprint arXiv:2104.14426.","DOI":"10.1007\/s10994-020-05934-z"},{"key":"6274_CR11","doi-asserted-by":"crossref","unstructured":"Cropper, A., Duman\u010di\u0107, S., & Muggleton, S. H. (2020). Turning 30: New ideas in inductive logic programming. In Proceedings of the twenty-nineth international joint conference on artificial intelligence, IJCAI (pp. 4833\u20134839).","DOI":"10.24963\/ijcai.2020\/673"},{"key":"6274_CR12","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1613\/jair.1.13507","volume":"74","author":"A Cropper","year":"2022","unstructured":"Cropper, A., & Dumancic, S. (2022). Inductive logic programming at 30: A new introduction. Journal of Artificial Intelligence Research, 74, 765\u2013850. https:\/\/doi.org\/10.1613\/jair.1.13507.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"7","key":"6274_CR13","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1007\/s10994-019-05843-w","volume":"109","author":"A Cropper","year":"2020","unstructured":"Cropper, A., Evans, R., & Law, M. (2020). Inductive general game playing. Machine Learning, 109(7), 1393\u20131434.","journal-title":"Machine Learning"},{"issue":"4","key":"6274_CR14","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s10994-020-05934-z","volume":"110","author":"A Cropper","year":"2021","unstructured":"Cropper, A., & Morel, R. (2021). Learning programs by learning from failures. Machine Learning, 110(4), 801\u2013856.","journal-title":"Machine Learning"},{"issue":"7","key":"6274_CR15","doi-asserted-by":"publisher","first-page":"1323","DOI":"10.1007\/s10994-019-05834-x","volume":"109","author":"A Cropper","year":"2020","unstructured":"Cropper, A., & Tourret, S. (2020). Logical reduction of metarules. Machine Learning, 109(7), 1323\u20131369. https:\/\/doi.org\/10.1007\/s10994-019-05834-x.","journal-title":"Machine Learning"},{"key":"6274_CR16","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1145\/3453483.3454080","volume-title":"DreamCoder: Bootstrapping inductive program synthesis with wake-sleep library learning","author":"K Ellis","year":"2021","unstructured":"Ellis, K., Wong, C., Nye, M., Sabl\u00e9-Meyer, M., Morales, L., Hewitt, L., et al. (2021). DreamCoder: Bootstrapping inductive program synthesis with wake-sleep library learning (pp. 835\u2013850). New York: Association for Computing Machinery. https:\/\/doi.org\/10.1145\/3453483.3454080."},{"key":"6274_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.5714","volume":"61","author":"R Evans","year":"2018","unstructured":"Evans, R., & Grefenstette, E. (2018). Learning explanatory rules from noisy data. Journal of Artificial Intelligence Research, 61, 1\u201364.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6274_CR18","doi-asserted-by":"publisher","first-page":"103438","DOI":"10.1016\/j.artint.2020.103438","volume":"293","author":"R Evans","year":"2021","unstructured":"Evans, R., Hern\u00e1ndez-Orallo, J., Welbl, J., Kohli, P., & Sergot, M. (2021). Making sense of sensory input. Artificial Intelligence, 293, 103438. https:\/\/doi.org\/10.1016\/j.artint.2020.103438.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"6274_CR19","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF00114868","volume":"1","author":"BC Falkenhainer","year":"1986","unstructured":"Falkenhainer, B. C., & Michalski, R. S. (1986). Integrating quantitative and qualitative discovery: The ABACUS system. Machine Learning, 1(4), 367\u2013401.","journal-title":"Machine Learning"},{"issue":"4","key":"6274_CR20","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/3296979.3192382","volume":"53","author":"Y Feng","year":"2018","unstructured":"Feng, Y., Martins, R., Bastani, O., & Dillig, I. (2018). Program synthesis using conflict-driven learning. ACM SIGPLAN Notices, 53(4), 420\u2013435.","journal-title":"ACM SIGPLAN Notices"},{"key":"6274_CR21","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2014). Clingo= ASP+ control: Preliminary report. arXiv preprint arXiv:1405.3694."},{"issue":"2","key":"6274_CR22","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1609\/aimag.v34i2.2475","volume":"34","author":"M Genesereth","year":"2013","unstructured":"Genesereth, M., & Bj\u00f6rnsson, Y. (2013). The international general game playing competition. AI Magazine, 34(2), 107\u2013107.","journal-title":"AI Magazine"},{"key":"6274_CR23","doi-asserted-by":"crossref","unstructured":"Hemberg, E., Kelly, J., & O\u2019Reilly, U.-M. (2019). On domain knowledge and novelty to improve program synthesis performance with grammatical evolution. In Proceedings of the genetic and evolutionary computation conference (pp. 1039\u20131046).","DOI":"10.1145\/3321707.3321865"},{"key":"6274_CR24","doi-asserted-by":"crossref","unstructured":"Hocquette, C., & Muggleton, S. H. (2020). Complete bottom-up predicate invention in meta-interpretive learning. In Proceedings of the 29th international joint conference artificial intelligence (pp. 2312\u20132318).","DOI":"10.24963\/ijcai.2020\/320"},{"issue":"3\u20134","key":"6274_CR25","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1017\/S1471068418000261","volume":"18","author":"T Kaminski","year":"2018","unstructured":"Kaminski, T., Eiter, T., & Inoue, K. (2018). Exploiting answer set programming with external sources for meta-interpretive learning. Theory and Practice of Logic Programming, 18(3\u20134), 571\u2013588. https:\/\/doi.org\/10.1017\/S1471068418000261.","journal-title":"Theory and Practice of Logic Programming"},{"issue":"2","key":"6274_CR26","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1023\/A:1007365207130","volume":"26","author":"A Karali\u010d","year":"1997","unstructured":"Karali\u010d, A., & Bratko, I. (1997). First order regression. Machine Learning, 26(2), 147\u2013176.","journal-title":"Machine Learning"},{"key":"6274_CR27","doi-asserted-by":"crossref","unstructured":"Kitzelmann, E. (2009). Inductive programming: A survey of program synthesis techniques. In International workshop on approaches and applications of inductive programming (pp. 50\u201373). Springer.","DOI":"10.1007\/978-3-642-11931-6_3"},{"key":"6274_CR28","unstructured":"Kramer, S. (1996). Structural regression trees. In AAAI\/IAAI (Vol. 1, pp. 812\u2013819). Citeseer."},{"key":"6274_CR29","doi-asserted-by":"publisher","unstructured":"Langley, P., Bradshaw, G. L., & Simon, H. A. (1983). In: R. S. Michalski, J. G. Carbonell & T. M. Mitchell (Eds.), Rediscovering chemistry with the Bacon system (pp. 307\u2013329). Berlin: Springer. https:\/\/doi.org\/10.1007\/978-3-662-12405-5_10.","DOI":"10.1007\/978-3-662-12405-5_10"},{"key":"6274_CR30","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/1045343.1045369","volume":"63","author":"J Larson","year":"1977","unstructured":"Larson, J., & Michalski, R. S. (1977). Inductive inference of vl decision rules. ACM SIGART Bulletin, 63, 38\u201344.","journal-title":"ACM SIGART Bulletin"},{"key":"6274_CR31","volume-title":"Foundations of logic programming","author":"JW Lloyd","year":"2012","unstructured":"Lloyd, J. W. (2012). Foundations of logic programming. Berlin: Springer."},{"issue":"4","key":"6274_CR32","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF03037089","volume":"8","author":"SH Muggleton","year":"1991","unstructured":"Muggleton, S. H. (1991). Inductive logic programming. New Generation Computing, 8(4), 295\u2013318. https:\/\/doi.org\/10.1007\/BF03037089.","journal-title":"New Generation Computing"},{"issue":"3 &4","key":"6274_CR33","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"SH Muggleton","year":"1995","unstructured":"Muggleton, S. H. (1995). Inverse entailment and progol. New Generation Computing, 13(3 &4), 245\u2013286. https:\/\/doi.org\/10.1007\/BF03037227.","journal-title":"New Generation Computing"},{"key":"6274_CR34","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10994-013-5358-3","volume":"94","author":"SH Muggleton","year":"2014","unstructured":"Muggleton, S. H., Lin, D., Pahlavi, N., & Tamaddoni-Nezhad, A. (2014). Meta-interpretive learning: application to grammatical inference. Machine Learning, 94, 25\u201349.","journal-title":"Machine Learning"},{"key":"6274_CR35","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19\u201320","author":"SH Muggleton","year":"1994","unstructured":"Muggleton, S. H., & De Raedt, L. (1994). Inductive logic programming: Theory and methods. The Journal of Logic Programming, 19\u201320, 629\u2013679. https:\/\/doi.org\/10.1016\/0743-1066(94)90035-3. (Special Issue: Ten Years of Logic Programming).","journal-title":"The Journal of Logic Programming"},{"key":"6274_CR36","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/B978-1-55860-141-3.50052-3","volume-title":"Machine learning proceedings 1990","author":"B Nordhausen","year":"1990","unstructured":"Nordhausen, B., & Langley, P. (1990). A robust approach to numeric discovery. In B. Porter & R. Mooney (Eds.), Machine learning proceedings 1990 (pp. 411\u2013418). San Francisco: Morgan Kaufmann. https:\/\/doi.org\/10.1016\/B978-1-55860-141-3.50052-3."},{"key":"6274_CR37","doi-asserted-by":"publisher","unstructured":"Purga\u0142, S. J., Cerna, D. M., & Kaliszyk, C. (2022). Learning higher-order logic programs from failures. In IJCAI 2022 (pp. 2726\u20132733). https:\/\/doi.org\/10.24963\/ijcai.2022\/378.","DOI":"10.24963\/ijcai.2022\/378"},{"key":"6274_CR38","doi-asserted-by":"crossref","unstructured":"Raghothaman, M., Mendelson, J., Zhao, D., Naik, M., & Scholz, B. (2019). Provenance-guided synthesis of datalog programs. In Proceedings of the ACM on programming languages (Vol. 4(POPL), pp. 1\u201327).","DOI":"10.1145\/3371130"},{"key":"6274_CR39","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic program debugging","author":"EY Shapiro","year":"1983","unstructured":"Shapiro, E. Y. (1983). Algorithmic program debugging. Cambridge: MIT Press."},{"key":"6274_CR40","doi-asserted-by":"crossref","unstructured":"Si, X., Raghothaman, M., Heo, K., & Naik, M. (2019). Synthesizing datalog programs using numerical relaxation. In 28th international joint conference on artificial intelligence, IJCAI 2019. International joint conferences on artificial intelligence (pp. 6117\u20136124).","DOI":"10.24963\/ijcai.2019\/847"},{"key":"6274_CR41","doi-asserted-by":"crossref","unstructured":"Solar-Lezama, A. (2009). The sketching approach to program synthesis. In Asian symposium on programming languages and systems (pp. 4\u201313). Springer.","DOI":"10.1007\/978-3-642-10672-9_3"},{"key":"6274_CR42","doi-asserted-by":"crossref","unstructured":"Srinivasan, A. (2001). The ALEPH manual. Machine Learning at the Computing Laboratory.","DOI":"10.1023\/A:1010980106294"},{"issue":"2","key":"6274_CR43","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0743-1066(99)00018-7","volume":"40","author":"A Srinivasan","year":"1999","unstructured":"Srinivasan, A., & Camacho, R. (1999). Numerical reasoning with an ILP system capable of lazy evaluation and customised search. The Journal of Logic Programming, 40(2), 185\u2013213. https:\/\/doi.org\/10.1016\/S0743-1066(99)00018-7.","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"6274_CR44","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10994-006-8262-2","volume":"64","author":"A Srinivasan","year":"2006","unstructured":"Srinivasan, A., Page, D., Camacho, R., & King, R. (2006). Quantitative pharmacophore models with inductive logic programming. Machine Learning, 64(1), 65\u201390.","journal-title":"Machine Learning"},{"key":"6274_CR45","unstructured":"Wahlig, J. (2022). Learning logic programs from noisy failures. CoRR arxiv:2201.03702."},{"key":"6274_CR46","doi-asserted-by":"crossref","unstructured":"Zytkow, J. M. (1987). Combining many searches in the FAHRENHEIT discovery system. In Proceedings of the fourth international workshop on machine learning (pp. 281\u2013287). Elsevier.","DOI":"10.1016\/B978-0-934613-41-5.50032-5"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06274-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-022-06274-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06274-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T21:28:16Z","timestamp":1729114096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-022-06274-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,22]]},"references-count":46,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["6274"],"URL":"https:\/\/doi.org\/10.1007\/s10994-022-06274-w","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2023,3,22]]},"assertion":[{"value":"12 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interets.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}]}}