{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T16:17:40Z","timestamp":1774023460998,"version":"3.50.1"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031427527","type":"print"},{"value":"9783031427534","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-42753-4_16","type":"book-chapter","created":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T06:02:35Z","timestamp":1693375355000},"page":"237-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["CoProver: A Recommender System for\u00a0Proof Construction"],"prefix":"10.1007","author":[{"given":"Eric","family":"Yeh","sequence":"first","affiliation":[]},{"given":"Briland","family":"Hitaj","sequence":"additional","affiliation":[]},{"given":"Sam","family":"Owre","sequence":"additional","affiliation":[]},{"given":"Maena","family":"Quemener","sequence":"additional","affiliation":[]},{"given":"Natarajan","family":"Shankar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,28]]},"reference":[{"key":"16_CR1","unstructured":"Alama, J., K\u00fchlwein, D., Tsivtsivadze, E., Urban, J., Heskes, T.: Premise selection for mathematics by corpus analysis and kernel methods. CoRR abs\/1108.3446 (2011). arXiv:1108.3446"},{"key":"16_CR2","unstructured":"Balunovic, M., Bielik, P., Vechev, M.T.: Learning to solve SMT formulas. In: NeurIPS, pp. 10338\u201310349 (2018)"},{"key":"16_CR3","unstructured":"Bansal, K., Loos, S., Rabe, M., Szegedy, C., Wilcox, S.: Holist: An environment for machine learning of higher order logic theorem proving. In: International Conference on Machine Learning, pp. 454\u2013463. PMLR (2019)"},{"key":"16_CR4","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press (2009)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Blanchette, J.C., Greenaway, D., Kaliszyk, C., K\u00fchlwein, D., Urban, J.: A learning-based fact selector for Isabelle\/HOL. J. Autom. Reason. 57(3), 219\u2013244 (2016)","DOI":"10.1007\/s10817-016-9362-8"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Bromley, J., Guyon, I., LeCun, Y., S\u00e4ckinger, E., Shah, R.: Signature verification using a \"siamese\" time delay neural network. In: Advances in Neural Information Processing Systems, vol. 6 (1993)","DOI":"10.1142\/9789812797926_0003"},{"key":"16_CR7","unstructured":"Brown, T.B., et al.: Language models are few-shot learners. CoRR abs\/2005.14165 (2020). arXiv:2005.14165"},{"key":"16_CR8","unstructured":"Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: Pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pp. 4171\u20134186. Association for Computational Linguistics, Minneapolis, Minnesota (Jun 2019). 10.18653\/v1\/N19-1423, http:\/\/aclanthology.org\/N19-1423"},{"key":"16_CR9","unstructured":"Efron, B., Tibshirani, R.J.: An Introduction to the Bootstrap. No. 57 in Monographs on Statistics and Applied Probability, Chapman & Hall\/CRC, Boca Raton, Florida, USA (1993)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"First, E., Brun, Y., Guha, A.: Tactok: semantics-aware proof synthesis. In: Proceedings of the ACM on Programming Languages 4(OOPSLA), pp. 1\u201331 (2020)","DOI":"10.1145\/3428299"},{"key":"16_CR11","unstructured":"Gage, P.: A new algorithm for data compression. C Users J. D(2), 23\u201338 (1994)"},{"key":"16_CR12","unstructured":"Gauthier, T., Kaliszyk, C., Urban, J.: Learning to reason with hol4 tactics. arXiv preprint arXiv:1804.00595 (2018)"},{"key":"16_CR13","unstructured":"Gauthier, T., Kaliszyk, C., Urban, J., Kumar, R., Norrish, M.: Learning to prove with tactics. CoRR abs\/1804.00596 (2018), arXiv:1804.00596"},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10817-020-09580-x","volume":"65","author":"T Gauthier","year":"2021","unstructured":"Gauthier, T., Kaliszyk, C., Urban, J., Kumar, R., Norrish, M.: Tactictoe: learning to prove with tactics. J. Autom. Reason. 65(2), 257\u2013286 (2021)","journal-title":"J. Autom. Reason."},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-319-21401-6_16","volume-title":"Automated Deduction - CADE-25","author":"T Gransden","year":"2015","unstructured":"Gransden, T., Walkinshaw, N., Raman, R.: SEPIA: search for proofs using inferred automata. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 246\u2013255. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21401-6_16"},{"key":"16_CR16","unstructured":"Hsu, C.W., Chang, C.C., Lin, C.J.: A practical guide to support vector classification. Tech. rep., Department of Computer Science, National Taiwan University (2003). http:\/\/www.csie.ntu.edu.tw\/~cjlin\/papers.html"},{"key":"16_CR17","unstructured":"Huang, D., Dhariwal, P., Song, D., Sutskever, I.: Gamepad: A learning environment for theorem proving. arXiv preprint arXiv:1806.00608 (2018)"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Huang, P.S., He, X., Gao, J., Deng, L., Acero, A., Heck, L.: Learning deep structured semantic models for web search using clickthrough data. In: Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, pp. 2333\u20132338. CIKM \u201913, Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2505515.2505665","DOI":"10.1145\/2505515.2505665"},{"key":"16_CR19","first-page":"2235","volume":"29","author":"G Irving","year":"2016","unstructured":"Irving, G., Szegedy, C., Alemi, A.A., E\u00e9n, N., Chollet, F., Urban, J.: Deepmath-deep sequence models for premise selection. Adv. Neural. Inf. Process. Syst. 29, 2235\u20132243 (2016)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"16_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-319-62075-6_20","volume-title":"Intelligent Computer Mathematics","author":"J Jakub\u016fv","year":"2017","unstructured":"Jakub\u016fv, J., Urban, J.: ENIGMA: efficient learning-based inference guiding machine. In: Geuvers, H., England, M., Hasan, O., Rabe, F., Teschke, O. (eds.) CICM 2017. LNCS (LNAI), vol. 10383, pp. 292\u2013302. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62075-6_20"},{"key":"16_CR21","doi-asserted-by":"publisher","unstructured":"Jiang, A.Q., et al.: Thor: Wielding hammers to integrate language models and automated theorem provers (2022). https:\/\/doi.org\/10.48550\/ARXIV.2205.10893, arXiv:2205.10893","DOI":"10.48550\/ARXIV.2205.10893"},{"key":"16_CR22","doi-asserted-by":"publisher","unstructured":"Jiang, A.Q., et al.: Draft, sketch, and prove: Guiding formal theorem provers with informal proofs (2022). https:\/\/doi.org\/10.48550\/ARXIV.2210.12283, arXiv:2210.12283","DOI":"10.48550\/ARXIV.2210.12283"},{"key":"16_CR23","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1108\/eb026526","volume":"28","author":"KS Jones","year":"1972","unstructured":"Jones, K.S.: A statistical interpretation of term specificity and its application in retrieval. J. Document. 28, 11\u201321 (1972)","journal-title":"J. Document."},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Kaliszyk, C., Urban, J.: Femalecop: Fairly efficient machine learning connection prover. In: Logic for Programming, Artificial Intelligence, and Reasoning. pp. 88\u201396. Springer (2015)","DOI":"10.1007\/978-3-662-48899-7_7"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Komendantskaya, E., Heras, J., Grov, G.: Machine learning in proof general: Interfacing interfaces. arXiv preprint arXiv:1212.3618 (2012)","DOI":"10.4204\/EPTCS.118.2"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-39634-2_6","volume-title":"Interactive Theorem Proving","author":"D K\u00fchlwein","year":"2013","unstructured":"K\u00fchlwein, D., Blanchette, J.C., Kaliszyk, C., Urban, J.: MaSh: machine learning for sledgehammer. In: Blazy, S., Paulin-Mohring, C., Pichardie, D. (eds.) ITP 2013. LNCS, vol. 7998, pp. 35\u201350. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39634-2_6"},{"key":"16_CR27","doi-asserted-by":"publisher","unstructured":"Lample, Get al.: Hypertree proof search for neural theorem proving (2022). https:\/\/doi.org\/10.48550\/ARXIV.2205.11491, arXiv:2205.11491","DOI":"10.48550\/ARXIV.2205.11491"},{"key":"16_CR28","unstructured":"Li, S., et al.: PyTorch Distributed: Experiences on accelerating data parallel training. CoRR abs\/2006.15704 (2020), arXiv:2006.15704"},{"key":"16_CR29","unstructured":"Li, W., Yu, L., Wu, Y., Paulson, L.C.: Isarstep: a benchmark for high-level mathematical reasoning. arXiv preprint arXiv:2006.09265 (2020)"},{"key":"16_CR30","doi-asserted-by":"publisher","unstructured":"Liu, Y., et al.: RoBERTa: A robustly optimized BERT pretraining approach (2019). https:\/\/doi.org\/10.48550\/ARXIV.1907.11692, arXiv:1907.11692","DOI":"10.48550\/ARXIV.1907.11692"},{"key":"16_CR31","unstructured":"Loos, S., Irving, G., Szegedy, C., Kaliszyk, C.: Deep network guided proof search. arXiv preprint arXiv:1701.06972 (2017)"},{"issue":"4","key":"16_CR32","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1147\/rd.14.0309","volume":"1","author":"HP Luhn","year":"1957","unstructured":"Luhn, H.P.: A statistical approach to mechanized encoding and searching of literary information. IBM J. Res. Dev. 1(4), 309\u2013317 (1957). https:\/\/doi.org\/10.1147\/rd.14.0309","journal-title":"IBM J. Res. Dev."},{"key":"16_CR33","unstructured":"Manning, C.D., Raghavan, P., Schatze, H.: Introduction to Information Retrieval. Cambridge University Press, Cambridge, UK (2008). http:\/\/nlp.stanford.edu\/IR-book\/information-retrieval-book.html"},{"key":"16_CR34","unstructured":"Miku\u0142a, M., et al.: Magnushammer: A transformer-based approach to premise selection (2023)"},{"key":"16_CR35","unstructured":"Mitra, B., Craswell, N.: (2018)"},{"issue":"1\u20132","key":"16_CR36","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0747-7171(03)00037-3","volume":"36","author":"J Otten","year":"2003","unstructured":"Otten, J., Bibel, W.: leancop: lean connection-based theorem proving. J. Symb. Comput. 36(1\u20132), 139\u2013161 (2003)","journal-title":"J. Symb. Comput."},{"key":"16_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1007\/3-540-55602-8_217","volume-title":"Automated Deduction\u2014CADE-11","author":"S Owre","year":"1992","unstructured":"Owre, S., Rushby, J.M., Shankar, N.: PVS: a prototype verification system. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 748\u2013752. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55602-8_217"},{"key":"16_CR38","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-030-79876-5_2","volume-title":"Automated Deduction \u2013 CADE 28","author":"MN Rabe","year":"2021","unstructured":"Rabe, M.N., Szegedy, C.: Towards the automatic mathematician. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 25\u201337. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_2"},{"key":"16_CR39","unstructured":"Raffel, C., et al.: Exploring the limits of transfer learning with a unified text-to-text transformer. CoRR abs\/1910.10683 (2019), arXiv:1910.10683"},{"key":"16_CR40","doi-asserted-by":"crossref","unstructured":"Reimers, N., Gurevych, I.: Sentence-BERT: Sentence embeddings using Siamese BERT-Networks. CoRR abs\/1908.10084 (2019). arXiv:1908.10084","DOI":"10.18653\/v1\/D19-1410"},{"issue":"2\/3","key":"16_CR41","first-page":"111","volume":"15","author":"S Schulz","year":"2002","unstructured":"Schulz, S.: E - a brainiac theorem prover. J. AI Commun. 15(2\/3), 111\u2013126 (2002)","journal-title":"J. AI Commun."},{"key":"16_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-030-24258-9_24","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"D Selsam","year":"2019","unstructured":"Selsam, D., Bj\u00f8rner, N.: Guiding high-performance SAT solvers with Unsat-core predictions. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 336\u2013353. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_24"},{"key":"16_CR43","doi-asserted-by":"publisher","unstructured":"Sennrich, R., Haddow, B., Birch, A.: Neural machine translation of rare words with subword units. In: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pp. 1715\u20131725. Association for Computational Linguistics, Berlin, Germany (Aug 2016). https:\/\/doi.org\/10.18653\/v1\/P16-1162, http:\/\/aclanthology.org\/P16-1162","DOI":"10.18653\/v1\/P16-1162"},{"key":"16_CR44","doi-asserted-by":"publisher","unstructured":"Shankar, N.: Automated reasoning, fast and slow. In: Proceedings of the 24th international conference on Automated Deduction, pp. 145\u2013161. CADE\u201913, Springer-Verlag, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38574-2_10, http:\/\/dx.doi.org\/10.1007\/978-3-642-38574-2_10","DOI":"10.1007\/978-3-642-38574-2_10"},{"key":"16_CR45","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-22119-4_21","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"J Urban","year":"2011","unstructured":"Urban, J., Vysko\u010dil, J., \u0160t\u011bp\u00e1nek, P.: MaLeCoP machine learning connection prover. In: Br\u00fcnnler, K., Metcalfe, G. (eds.) TABLEAUX 2011. LNCS (LNAI), vol. 6793, pp. 263\u2013277. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22119-4_21"},{"key":"16_CR46","unstructured":"Vaswani, A.,et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"16_CR47","unstructured":"Wang, M., Tang, Y., Wang, J., Deng, J.: Premise selection for theorem proving by deep graph embedding. arXiv preprint arXiv:1709.09994 (2017)"},{"key":"16_CR48","unstructured":"Whalen, D.: Holophrasm: a neural automated theorem prover for higher-order logic. arXiv preprint arXiv:1608.02644 (2016)"},{"key":"16_CR49","unstructured":"Wolf, T., et al.: Transformers: State-of-the-art natural language processing. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, pp. 38\u201345. Association for Computational Linguistics, Online (Oct 2020), www.aclweb.org\/anthology\/2020.emnlp-demos.6"},{"key":"16_CR50","unstructured":"Wu, M., Norrish, M., Walder, C., Dezfouli, A.: Tacticzero: Learning to prove theorems from scratch with deep reinforcement learning. arXiv preprint arXiv:2102.09756 (2021)"},{"key":"16_CR51","unstructured":"Yang, K., Deng, J.: Learning to prove theorems via interacting with proof assistants. In: International Conference on Machine Learning, pp. 6984\u20136994. PMLR (2019)"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-42753-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T06:04:19Z","timestamp":1693375459000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-42753-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031427527","9783031427534"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-42753-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computer Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2023\/cicm.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"52% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}