{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:07:30Z","timestamp":1753884450429,"version":"3.41.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319620749"},{"type":"electronic","value":"9783319620756"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62075-6_20","type":"book-chapter","created":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T14:58:50Z","timestamp":1498575530000},"page":"292-302","source":"Crossref","is-referenced-by-count":32,"title":["ENIGMA: Efficient Learning-Based Inference Guiding Machine"],"prefix":"10.1007","author":[{"given":"Jan","family":"Jakub\u016fv","sequence":"first","affiliation":[]},{"given":"Josef","family":"Urban","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10817-016-9362-8","volume":"57","author":"JC Blanchette","year":"2016","unstructured":"Blanchette, J.C., Greenaway, D., Kaliszyk, C., K\u00fchlwein, D., Urban, J.: A learning-based fact selector for Isabelle\/HOL. J. Autom. Reasoning 57(3), 219\u2013244 (2016)","journal-title":"J. Autom. Reasoning"},{"issue":"1","key":"20_CR2","first-page":"101","volume":"9","author":"JC Blanchette","year":"2016","unstructured":"Blanchette, J.C., Kaliszyk, C., Paulson, L.C., Urban, J.: Hammering towards QED. J. Formalized Reasoning 9(1), 101\u2013148 (2016)","journal-title":"J. Formalized Reasoning"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Boser, B.E., Guyon, I., Vapnik, V.: A training algorithm for optimal margin classifiers. In: COLT, pp. 144\u2013152. ACM (1992)","DOI":"10.1145\/130385.130401"},{"key":"20_CR4","first-page":"1871","volume":"9","author":"R Fan","year":"2008","unstructured":"Fan, R., Chang, K., Hsieh, C., Wang, X., Lin, C.: LIBLINEAR: A library for large linear classification. J. Mach. Learn. Res. 9, 1871\u20131874 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"20_CR5","unstructured":"F\u00e4rber, M., Kaliszyk, C., Urban, J.: Monte Carlo connection prover. CoRR, abs\/1611.05990 (2016)"},{"key":"20_CR6","unstructured":"Gottlob, G., Sutcliffe, G., Voronkov, A. (eds.) Global Conference on Artificial Intelligence (GCAI 2015), Tbilisi, Georgia. EPiC Series in Computing, EasyChair, vol. 36, 16\u201319 October 2015"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","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, vol. 9195, pp. 246\u2013255. Springer, Cham (2015). doi: 10.1007\/978-3-319-21401-6_16"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Hsieh, C., Chang, K., Lin, C., Keerthi, S.S., Sundararajan, S.: A dual coordinate descent method for large-scale linear SVM. In: ICML, ACM International Conference Proceeding Series, vol. 307, pp. 408\u2013415. ACM (2008)","DOI":"10.1145\/1390156.1390208"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Jakubuv, J., Urban, J.: BliStrTune: hierarchical invention of theorem proving strategies. In: Bertot, Y., Vafeiadis, V. (eds.) Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs (CPP 2017), Paris, France. pp. 43\u201352. ACM. 16\u201317 January 2017(2017)","DOI":"10.1145\/3018610.3018619"},{"issue":"2","key":"20_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10817-014-9303-3","volume":"53","author":"C Kaliszyk","year":"2014","unstructured":"Kaliszyk, C., Urban, J.: Learning-assisted automated reasoning with Flyspeck. J. Autom. Reasoning 53(2), 173\u2013213 (2014)","journal-title":"J. Autom. Reasoning"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-662-48899-7_7","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"C Kaliszyk","year":"2015","unstructured":"Kaliszyk, C., Urban, J.: FEMaLeCoP: Fairly efficient machine learning connection prover. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR 2015. LNCS, vol. 9450, pp. 88\u201396. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-48899-7_7"},{"issue":"3","key":"20_CR12","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10817-015-9330-8","volume":"55","author":"C Kaliszyk","year":"2015","unstructured":"Kaliszyk, C., Urban, J.: MizAR 40 for Mizar 40. J. Autom. Reasoning 55(3), 245\u2013256 (2015)","journal-title":"J. Autom. Reasoning"},{"key":"20_CR13","unstructured":"Kaliszyk, C., Urban, J., Vysko\u010dil, J.: Machine learner for automated reasoning 0.4 and 0.5. CoRR, abs\/1402.2359, 2014, Accepted to (PAAR 2014)"},{"key":"20_CR14","unstructured":"Kaliszyk, C., Urban, J., Vysko\u010dil, J.: Efficient semantic features for automated reasoning over large theories. In: Yang, Q., Wooldridge, M. (eds.) IJCAI 2015, pp. 3084\u20133090. AAAI Press (2015)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-36675-8_8","volume-title":"Automated Reasoning and Mathematics","author":"M Kinyon","year":"2013","unstructured":"Kinyon, M., Veroff, R., Vojt\u011bchovsk\u00fd, P.: Loops with Abelian inner mapping groups: an application of automated deduction. In: Bonacina, M.P., Stickel, M.E. (eds.) Automated Reasoning and Mathematics. LNCS, vol. 7788, pp. 151\u2013164. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-36675-8_8"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-39799-8_1","volume-title":"Computer Aided Verification","author":"L Kov\u00e1cs","year":"2013","unstructured":"Kov\u00e1cs, L., Voronkov, A.: First-order theorem proving and vampire. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 1\u201335. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-39799-8_1"},{"issue":"2","key":"20_CR17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10817-015-9329-1","volume":"55","author":"D K\u00fchlwein","year":"2015","unstructured":"K\u00fchlwein, D., Urban, J.: MaLeS: A framework for automatic tuning of automated theorem provers. J. Autom. Reasoning 55(2), 91\u2013116 (2015)","journal-title":"J. Autom. Reasoning"},{"key":"20_CR18","first-page":"627","volume":"9","author":"C Lin","year":"2008","unstructured":"Lin, C., Weng, R.C., Keerthi, S.S.: Trust region newton method for logistic regression. J. Mach. Learn. Res. 9, 627\u2013650 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"1\u20132","key":"20_CR19","doi-asserted-by":"crossref","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":"20_CR20","unstructured":"Sch\u00e4fer, S., Schulz, S.: Breeding theorem proving heuristics with genetic algorithms. In: Gottlob et al. [6], pp. 263\u2013274"},{"issue":"2\u20133","key":"20_CR21","first-page":"111","volume":"15","author":"S Schulz","year":"2002","unstructured":"Schulz, S.: E - A Brainiac Theorem Prover. AI Commun. 15(2\u20133), 111\u2013126 (2002)","journal-title":"AI Commun."},{"issue":"5","key":"20_CR22","doi-asserted-by":"crossref","first-page":"607","DOI":"10.3233\/AIC-160709","volume":"29","author":"G Sutcliffe","year":"2016","unstructured":"Sutcliffe, G.: The 8th IJCAR automated theorem proving system competition - CASC-J8. AI Commun. 29(5), 607\u2013619 (2016)","journal-title":"AI Commun."},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Urban, J.: BliStr: The Blind Strategymaker. In: Gottlob et al. [6], pp. 312\u2013319","DOI":"10.29007\/8n7m"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-540-71070-7_37","volume-title":"Automated Reasoning","author":"J Urban","year":"2008","unstructured":"Urban, J., Sutcliffe, G., Pudl\u00e1k, P., Vysko\u010dil, J.: MaLARea SG1 - Machine learner for automated reasoning with semantic guidance. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS, vol. 5195, pp. 441\u2013456. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-71070-7_37"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science","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, vol. 6793, pp. 263\u2013277. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22119-4_21"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62075-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T02:43:12Z","timestamp":1750387392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62075-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319620749","9783319620756"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62075-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}