{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T22:57:48Z","timestamp":1773442668312,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:00:00Z","timestamp":1642377600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000781","name":"european research council","doi-asserted-by":"publisher","award":["713999"],"award-info":[{"award-number":["713999"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"nederlandse organisatie voor wetenschappelijk onderzoek","doi-asserted-by":"publisher","award":["016.Vidi.189.037"],"award-info":[{"award-number":["016.Vidi.189.037"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10817-021-09613-z","type":"journal-article","created":{"date-parts":[[2022,1,17]],"date-time":"2022-01-17T00:03:47Z","timestamp":1642377827000},"page":"541-564","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Making Higher-Order Superposition Work"],"prefix":"10.1007","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7049-6847","authenticated-orcid":false,"given":"Petar","family":"Vukmirovi\u0107","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7158-3595","authenticated-orcid":false,"given":"Alexander","family":"Bentkamp","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8367-0936","authenticated-orcid":false,"given":"Jasmin","family":"Blanchette","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3969-5850","authenticated-orcid":false,"given":"Simon","family":"Cruanes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0078-790X","authenticated-orcid":false,"given":"Visa","family":"Nummelin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6070-796X","authenticated-orcid":false,"given":"Sophie","family":"Tourret","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,17]]},"reference":[{"key":"9613_CR1","doi-asserted-by":"crossref","unstructured":"Bachmair, L., Ganzinger, H.: Non-clausal resolution and superposition with selection and redundancy criteria. In: Voronkov, A. (ed.) LPAR \u201992, LNCS, vol. 624, pp. 273\u2013284. Springer (1992)","DOI":"10.1007\/BFb0013068"},{"issue":"4","key":"9613_CR2","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10817-011-9233-2","volume":"47","author":"J Backes","year":"2011","unstructured":"Backes, J., Brown, C.E.: Analytic tableaux for higher-order logic with choice. J. Autom. Reason. 47(4), 451\u2013479 (2011)","journal-title":"J. Autom. Reason."},{"key":"9613_CR3","doi-asserted-by":"crossref","unstructured":"Barbosa, H., Reynolds, A., El Ouraoui, D., Tinelli, C., Barrett, C.W.: Extending SMT solvers to higher-order logic. In: Fontaine, P. (ed.) CADE-27, LNCS, vol. 11716, pp. 35\u201354. Springer (2019)","DOI":"10.1007\/978-3-030-29436-6_3"},{"key":"9613_CR4","doi-asserted-by":"crossref","unstructured":"Barrett, C.W., Conway, C.L., Deters, M., Hadarean, L., Jovanovi\u0107, D., King, T., Reynolds, A., Tinelli, C.: CVC4. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011, LNCS, vol. 6806, pp. 171\u2013177. Springer (2011)","DOI":"10.1007\/978-3-642-22110-1_14"},{"key":"9613_CR5","doi-asserted-by":"crossref","unstructured":"Bentkamp, A., Blanchette, J., Tourret, S., Vukmirovi\u0107, P.: Superposition for full higher-order logic. In: Platzer, A., Sutcliffe, G. (eds.) CADE-28, LNCS, vol. 12699, pp. 396\u2013412. Springer (2021)","DOI":"10.1007\/978-3-030-79876-5_23"},{"issue":"7","key":"9613_CR6","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1007\/s10817-021-09595-y","volume":"65","author":"A Bentkamp","year":"2021","unstructured":"Bentkamp, A., Blanchette, J., Tourret, S., Vukmirovi\u0107, P., Waldmann, U.: Superposition with lambdas. J. Autom. Reason. 65(7), 893\u2013940 (2021)","journal-title":"J. Autom. Reason."},{"key":"9613_CR7","doi-asserted-by":"crossref","unstructured":"Bentkamp, A., Blanchette, J.C., Cruanes, S., Waldmann, U.: Superposition for lambda-free higher-order logic. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) IJCAR 2018, LNCS, vol. 10900, pp. 28\u201346. Springer (2018)","DOI":"10.1007\/978-3-319-94205-6_3"},{"key":"9613_CR8","doi-asserted-by":"crossref","unstructured":"Benzm\u00fcller, C., Sorge, V., Jamnik, M., Kerber, M.: Can a higher-order and a first-order theorem prover cooperate? In: Baader, F., Voronkov, A. (eds.) LPAR 2004, LNCS, vol. 3452, pp. 415\u2013431. Springer (2004)","DOI":"10.1007\/978-3-540-32275-7_27"},{"key":"9613_CR9","doi-asserted-by":"crossref","unstructured":"Bhayat, A., Reger, G.: Restricted combinatory unification. In: Fontaine, P. (ed.) CADE-27, LNCS, vol. 11716, pp. 74\u201393. Springer (2019)","DOI":"10.1007\/978-3-030-29436-6_5"},{"key":"9613_CR10","doi-asserted-by":"crossref","unstructured":"Bhayat, A., Reger, G.: A combinator-based superposition calculus for higher-order logic. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020, Part I, LNCS, vol. 12166, pp. 278\u2013296. Springer (2020)","DOI":"10.1007\/978-3-030-51074-9_16"},{"issue":"1","key":"9613_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10817-013-9283-8","volume":"51","author":"CE Brown","year":"2013","unstructured":"Brown, C.E.: Reducing higher-order theorem proving to a sequence of SAT problems. J. Autom. Reason. 51(1), 57\u201377 (2013)","journal-title":"J. Autom. Reason."},{"key":"9613_CR12","unstructured":"Cruanes, S.: Extending superposition with integer arithmetic, structural induction, and beyond. Ph.D. thesis, \u00c9cole polytechnique (2015)"},{"issue":"1\u20134","key":"9613_CR13","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10817-018-9458-4","volume":"61","author":"L Czajka","year":"2018","unstructured":"Czajka, L., Kaliszyk, C.: Hammer for Coq: automation for dependent type theory. J. Autom. Reason. 61(1\u20134), 423\u2013453 (2018)","journal-title":"J. Autom. Reason."},{"issue":"2","key":"9613_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1023\/A:1005879229581","volume":"18","author":"J Denzinger","year":"1997","unstructured":"Denzinger, J., Kronenburg, M., Schulz, S.: DISCOUNT\u2014a distributed and learning equational prover. J. Autom. Reason. 18(2), 189\u2013198 (1997)","journal-title":"J. Autom. Reason."},{"key":"9613_CR15","doi-asserted-by":"crossref","unstructured":"Ebner, G., Blanchette, J., Tourret, S.: Unifying splitting. In: Platzer, A., Sutcliffe, G. (eds.) CADE-28, LNCS, vol. 12699, pp. 344\u2013360. Springer (2021)","DOI":"10.1007\/978-3-030-79876-5_20"},{"key":"9613_CR16","doi-asserted-by":"crossref","unstructured":"F\u00e4rber, M., Brown, C.E.: Internal guidance for Satallax. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016, LNCS, vol. 9706, pp. 349\u2013361. Springer (2016)","DOI":"10.1007\/978-3-319-40229-1_24"},{"key":"9613_CR17","doi-asserted-by":"crossref","unstructured":"Filli\u00e2tre, J., Paskevich, A.: Why3\u2014where programs meet provers. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013, LNCS, vol. 7792, pp. 125\u2013128. Springer (2013)","DOI":"10.1007\/978-3-642-37036-6_8"},{"key":"9613_CR18","doi-asserted-by":"crossref","unstructured":"Ganzinger, H., Stuber, J.: Superposition with equivalence reasoning and delayed clause normal form transformation. In: Baader, F. (ed.) CADE-19, LNCS, vol. 2741, pp. 335\u2013349. Springer (2003)","DOI":"10.1007\/978-3-540-45085-6_31"},{"key":"9613_CR19","doi-asserted-by":"crossref","unstructured":"Gleiss, B., Suda, M.: Layered clause selection for theory reasoning (short paper). In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020, Part I, LNCS, vol. 12166, pp. 402\u2013409. Springer (2020)","DOI":"10.1007\/978-3-030-51074-9_23"},{"issue":"2","key":"9613_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2266967","volume":"15","author":"L Henkin","year":"1950","unstructured":"Henkin, L.: Completeness in the theory of types. J. Symb. Log. 15(2), 81\u201391 (1950)","journal-title":"J. Symb. Log."},{"key":"9613_CR21","doi-asserted-by":"crossref","unstructured":"Hoder, K., Reger, G., Suda, M., Voronkov, A.: Selecting the selection. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016, LNCS, vol. 9706, pp. 313\u2013329. Springer (2016)","DOI":"10.1007\/978-3-319-40229-1_22"},{"key":"9613_CR22","doi-asserted-by":"crossref","unstructured":"Hoder, K., Voronkov, A.: Comparing unification algorithms in first-order theorem proving. In: Mertsching, B., Hund, M., Aziz, M.Z. (eds.) KI 2009, LNCS, vol. 5803, pp. 435\u2013443. Springer (2009)","DOI":"10.1007\/978-3-642-04617-9_55"},{"issue":"1","key":"9613_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"GP Huet","year":"1975","unstructured":"Huet, G.P.: A unification algorithm for typed lambda-calculus. Theor. Comput. Sci. 1(1), 27\u201357 (1975)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9613_CR24","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(76)90021-9","volume":"3","author":"DC Jensen","year":"1976","unstructured":"Jensen, D.C., Pietrzykowski, T.: Mechanizing omega-order type theory through unification. Theor. Comput. Sci. 3(2), 123\u2013171 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"9613_CR25","doi-asserted-by":"crossref","unstructured":"Johnsson, T.: Lambda lifting: transforming programs to recursive equations. In: Jouannaud, J. (ed.) FPCA 1985, LNCS, vol. 201, pp. 190\u2013203. Springer (1985)","DOI":"10.1007\/3-540-15975-4_37"},{"issue":"1","key":"9613_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s11786-014-0182-0","volume":"9","author":"C Kaliszyk","year":"2015","unstructured":"Kaliszyk, C., Urban, J.: HOL(y)Hammer: online ATP service for HOL light. Math. Comput. Sci. 9(1), 5\u201322 (2015)","journal-title":"Math. Comput. Sci."},{"key":"9613_CR27","doi-asserted-by":"crossref","unstructured":"Knuth, D.E., Bendix, P.B.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263\u2013297. Pergamon (1970)","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"9613_CR28","unstructured":"Kohlhase, M.: A mechanization of sorted higher-order logic based on the resolution principle. Ph.D. thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany (1994)"},{"key":"9613_CR29","doi-asserted-by":"crossref","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 (2013)","DOI":"10.1007\/978-3-642-39799-8_1"},{"key":"9613_CR30","unstructured":"Manna, Z., Waldinger, R.: A deductive approach to program synthesis. In: Buchanan, B.G. (ed.) IJCAI-79, pp. 542\u2013551. William Kaufmann (1979)"},{"issue":"2","key":"9613_CR31","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1005843632307","volume":"18","author":"W McCune","year":"1997","unstructured":"McCune, W., Wos, L.: Otter\u2014the CADE-13 competition incarnations. J. Autom. Reason. 18(2), 211\u2013220 (1997)","journal-title":"J. Autom. Reason."},{"issue":"1","key":"9613_CR32","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0004-3702(82)90011-X","volume":"18","author":"NV Murray","year":"1982","unstructured":"Murray, N.V.: Completely non-clausal theorem proving. Artif. Intell. 18(1), 67\u201385 (1982)","journal-title":"Artif. Intell."},{"key":"9613_CR33","doi-asserted-by":"crossref","unstructured":"Nipkow, T.: Functional unification of higher-order patterns. In: Best, E. (ed.) LICS 1993, pp. 64\u201374. IEEE Computer Society (1993)","DOI":"10.1109\/LICS.1993.287599"},{"key":"9613_CR34","doi-asserted-by":"crossref","unstructured":"Nonnengart, A., Weidenbach, C.: Computing small clause normal forms. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 335\u2013367. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50008-4"},{"key":"9613_CR35","doi-asserted-by":"crossref","unstructured":"Nummelin, V., Bentkamp, A., Tourret, S., Vukmirovi\u0107, P.: Superposition with first-class Booleans and inprocessing clausification. In: Platzer, A., Sutcliffe, G. (eds.) CADE-28, LNCS. Springer (2021)","DOI":"10.1007\/978-3-030-79876-5_22"},{"key":"9613_CR36","doi-asserted-by":"crossref","unstructured":"Okasaki, C.: Purely Functional Data Structures. Cambridge University Press (1999)","DOI":"10.1017\/CBO9780511530104"},{"key":"9613_CR37","doi-asserted-by":"crossref","unstructured":"Paulson, L.C., Blanchette, J.C.: Three years of experience with Sledgehammer, a practical link between automatic and interactive theorem provers. In: Sutcliffe, G., Schulz, S., Ternovska, E. (eds.) IWIL-2010, EPiC Series in Computing, vol. 2, pp. 1\u201311. EasyChair (2010)","DOI":"10.29007\/36dt"},{"key":"9613_CR38","doi-asserted-by":"crossref","unstructured":"Reger, G., Suda, M., Voronkov, A.: Playing with AVATAR. In: Felty, A.P., Middeldorp, A. (eds.) CADE-25, LNCS, vol. 9195, pp. 399\u2013415. Springer (2015)","DOI":"10.1007\/978-3-319-21401-6_28"},{"issue":"2\u20133","key":"9613_CR39","first-page":"111","volume":"15","author":"S Schulz","year":"2002","unstructured":"Schulz, S.: E\u2014a brainiac theorem prover. AI Commun. 15(2\u20133), 111\u2013126 (2002)","journal-title":"AI Commun."},{"key":"9613_CR40","doi-asserted-by":"crossref","unstructured":"Schulz, S., Cruanes, S., Vukmirovi\u0107, P.: Faster, higher, stronger: E 2.3. In: Fontaine, P. (ed.) CADE-27, LNCS, vol. 11716, pp. 495\u2013507. Springer (2019)","DOI":"10.1007\/978-3-030-29436-6_29"},{"key":"9613_CR41","doi-asserted-by":"crossref","unstructured":"Schulz, S., M\u00f6hrmann, M.: Performance of clause selection heuristics for saturation-based theorem proving. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016, LNCS, vol. 9706, pp. 330\u2013345. Springer (2016)","DOI":"10.1007\/978-3-319-40229-1_23"},{"key":"9613_CR42","doi-asserted-by":"crossref","unstructured":"Steen, A.: Extensional paramodulation for higher-order logic and its effective implementation Leo-III. Ph.D. thesis, Free University of Berlin, Dahlem, Germany (2018)","DOI":"10.1007\/s13218-019-00628-8"},{"key":"9613_CR43","doi-asserted-by":"crossref","unstructured":"Steen, A., Benzm\u00fcller, C.: There is no best $$\\beta $$-normalization strategy for higher-order reasoners. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds.) LPAR-20, LNCS, vol. 9450, pp. 329\u2013339. Springer (2015)","DOI":"10.1007\/978-3-662-48899-7_23"},{"issue":"6","key":"9613_CR44","doi-asserted-by":"publisher","first-page":"775","DOI":"10.1007\/s10817-021-09588-x","volume":"65","author":"A Steen","year":"2021","unstructured":"Steen, A., Benzm\u00fcller, C.: Extensional higher-order paramodulation in Leo-III. J. Autom. Reason. 65(6), 775\u2013807 (2021)","journal-title":"J. Autom. Reason."},{"key":"9613_CR45","doi-asserted-by":"crossref","unstructured":"Stump, A., Sutcliffe, G., Tinelli, C.: Starexec: a cross-community infrastructure for logic solving. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014, LNCS, vol. 8562, pp. 367\u2013373. Springer (2014)","DOI":"10.1007\/978-3-319-08587-6_28"},{"issue":"1","key":"9613_CR46","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jal.2012.12.002","volume":"11","author":"N Sultana","year":"2013","unstructured":"Sultana, N., Blanchette, J.C., Paulson, L.C.: LEO-II and Satallax on the Sledgehammer test bench. J. Appl. Log. 11(1), 91\u2013102 (2013)","journal-title":"J. Appl. Log."},{"issue":"2","key":"9613_CR47","first-page":"99","volume":"37","author":"G Sutcliffe","year":"2016","unstructured":"Sutcliffe, G.: The CADE ATP system competition-CASC. AI Mag. 37(2), 99\u2013101 (2016)","journal-title":"AI Mag."},{"issue":"4","key":"9613_CR48","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10817-017-9407-7","volume":"59","author":"G Sutcliffe","year":"2017","unstructured":"Sutcliffe, G.: The TPTP problem library and associated infrastructure\u2014from CNF to TH0. TPTP v6.4.0. J. Autom. Reason. 59(4), 483\u2013502 (2017)","journal-title":"J. Autom. Reason."},{"issue":"5\u20136","key":"9613_CR49","first-page":"373","volume":"32","author":"G Sutcliffe","year":"2019","unstructured":"Sutcliffe, G.: The CADE-27 automated theorem proving system competition\u2014CASC-27. AI Commun. 32(5\u20136), 373\u2013389 (2019)","journal-title":"AI Commun."},{"key":"9613_CR50","doi-asserted-by":"crossref","unstructured":"Sutcliffe, G.: The 10th IJCAR automated theorem proving system competition\u2014CASC-J10. AI Commun. (2021)","DOI":"10.3233\/AIC-201566"},{"issue":"2","key":"9613_CR51","doi-asserted-by":"publisher","first-page":"267","DOI":"10.2307\/2273733","volume":"44","author":"DA Turner","year":"1979","unstructured":"Turner, D.A.: Another algorithm for bracket abstraction. J. Symb. Log. 44(2), 267\u2013270 (1979)","journal-title":"J. Symb. Log."},{"key":"9613_CR52","doi-asserted-by":"crossref","unstructured":"Voronkov, A.: AVATAR: the architecture for first-order theorem provers. In: Biere, A., Bloem, R. (eds.) CAV 2014, LNCS, vol. 8559, pp. 696\u2013710. Springer (2014)","DOI":"10.1007\/978-3-319-08867-9_46"},{"key":"9613_CR53","doi-asserted-by":"crossref","unstructured":"Vukmirovi\u0107, P., Bentkamp, A., Nummelin, V.: Efficient full higher-order unification. In: Ariola, Z.M. (ed.) FSCD, LIPIcs, vol. 167, p. 5:1-5:17. Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik (2020)","DOI":"10.46298\/lmcs-17(4:18)2021"},{"key":"9613_CR54","doi-asserted-by":"crossref","unstructured":"Vukmirovi\u0107, P., Bentkamp, A., Blanchette, J., Cruanes, S., Nummelin, V., Tourret, S.: Making higher-order superposition work. In: Platzer, A., Sutcliffe, G. (eds.) CADE-28, LNCS, vol. 12699, pp. 415\u2013432. Springer (2021)","DOI":"10.1007\/978-3-030-79876-5_24"},{"key":"9613_CR55","doi-asserted-by":"crossref","unstructured":"Vukmirovi\u0107, P., Blanchette, J.C., Cruanes, S., Schulz, S.: Extending a brainiac prover to lambda-free higher-order logic. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019, Part I, LNCS, vol. 11427, pp. 192\u2013210. Springer (2019)","DOI":"10.1007\/978-3-030-17462-0_11"},{"key":"9613_CR56","unstructured":"Vukmirovi\u0107, P., Nummelin, V.: Boolean reasoning in a higher-order superposition prover. In: Fontaine, P., Korovin, K., Kotsireas, I. S., R\u00fcmmer, P., Tourret, S. (eds.) PAAR-2020, CEUR Workshop Proceedings, vol. 2752, pp. 148\u2013166. CEUR-WS.org (2020)"},{"key":"9613_CR57","doi-asserted-by":"crossref","unstructured":"Waldmann, U., Tourret, S., Robillard, S., Blanchette, J.: A comprehensive framework for saturation theorem proving. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020, Part I, LNCS, vol. 12166, pp. 316\u2013334. Springer (2020)","DOI":"10.1007\/978-3-030-51074-9_18"},{"key":"9613_CR58","doi-asserted-by":"crossref","unstructured":"Wisniewski, M., Steen, A., Kern, K., Benzm\u00fcller, C.: Effective normalization techniques for HOL. In: Olivetti, N., Tiwari, A. (eds.) IJCAR 2016, LNCS, vol. 9706, pp. 362\u2013370. Springer (2016)","DOI":"10.1007\/978-3-319-40229-1_25"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-021-09613-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10817-021-09613-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-021-09613-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T12:03:48Z","timestamp":1726488228000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10817-021-09613-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,17]]},"references-count":58,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["9613"],"URL":"https:\/\/doi.org\/10.1007\/s10817-021-09613-z","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,17]]},"assertion":[{"value":"23 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}