{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T11:37:26Z","timestamp":1773920246880,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032215390","type":"print"},{"value":"9783032215406","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-21540-6_23","type":"book-chapter","created":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T06:49:56Z","timestamp":1773902996000},"page":"353-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning SMT Algorithm Selection with\u00a0High-Level Natural-Language Descriptions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-9046-497X","authenticated-orcid":false,"given":"Zhengyang","family":"Lu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-5413-043X","authenticated-orcid":false,"given":"Paul","family":"Sarnighausen-Cahn","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8828-032X","authenticated-orcid":false,"given":"Jiahao","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5964-6792","authenticated-orcid":false,"given":"Arie","family":"Gurfinkel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6094-3324","authenticated-orcid":false,"given":"Florin","family":"Manea","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6029-2047","authenticated-orcid":false,"given":"Vijay","family":"Ganesh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,20]]},"reference":[{"key":"23_CR1","unstructured":"Bromberger, M., Bobot, F., Jon\u00e1\u0161, M.: SMT-COMP 2024. https:\/\/smt-comp.github.io\/2024\/ (2024), Accessed 22 Dec 2025"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"De\u00a0Moura, L., Bj\u00f8rner, N.: Satisfiability modulo theories: introduction and applications. Commun. ACM (2011)","DOI":"10.1145\/1995376.1995394"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Frisch, A.M., Harvey, W., Jefferson, C., Hern\u00e1ndez, B.M., Miguel, I.: Essence: a constraint language for specifying combinatorial problems. Constraints (2008)","DOI":"10.1007\/s10601-008-9047-y"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Loreggia, A., Malitsky, Y., Samulowitz, H., Saraswat, V.A.: Deep learning for algorithm portfolios. In: AAAI (2016)","DOI":"10.1609\/aaai.v30i1.10170"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Lu, Z., Chien, P., Lee, N., Gurfinkel, A., Ganesh, V.: Btor2-Select: machine learning based algorithm selection for hardware model checking. In: CAV (2025)","DOI":"10.1007\/978-3-031-98668-0_15"},{"key":"23_CR6","unstructured":"Lu, Z., Siemer, S., Jha, P., Day, J., Manea, F., Ganesh, V.: Layered and staged monte carlo tree search for smt strategy synthesis. In: IJCAI (2024)"},{"key":"23_CR7","unstructured":"Pellegrino, A., Akg\u00fcn, \u00d6., Dang, N., Kiziltan, Z., Miguel, I.: Transformer-based feature learning for algorithm selection in combinatorial optimisation. In: CP (2025)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Pimpalkhare, N., Mora, F., Polgreen, E., Seshia, S.A.: MedleySolver: online SMT algorithm selection. In: SAT, pp. 453\u2013470. Springer (2021)","DOI":"10.1007\/978-3-030-80223-3_31"},{"key":"23_CR9","unstructured":"Schurr, H., Preiner, M., Niemetz, A., Barrett, C.W., Fontaine, P., Tinelli, C.: SMT-LIB catalog 2025 (version 1), July 2025, https:\/\/doi.org\/10.5281\/zenodo.16290040, Accessed 16 Dec 2025"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Scott, J., Niemetz, A., Preiner, M., Nejati, S., Ganesh, V.: MachSMT: a machine learning-based algorithm selector for SMT solvers. In: TACAS (2021)","DOI":"10.1007\/978-3-030-72013-1_16"},{"key":"23_CR11","unstructured":"Sentence-Transformers: all-mpnet-base-v2. https:\/\/huggingface.co\/sentence-transformers\/all-mpnet-base-v2 (2021)"},{"key":"23_CR12","unstructured":"Song, K., Tan, X., Qin, T., Lu, J., Liu, T.: MPNet: masked and permuted pre-training for language understanding. In: NeurIPS 2020 (2020)"},{"key":"23_CR13","unstructured":"Vaswani, A., et al.: Attention is all you need. In: NIPS (2017)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Evaluating component solver contributions to portfolio-based algorithm selectors. In: SAT (2012)","DOI":"10.1007\/978-3-642-31612-8_18"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, Z., et al.: GraSS: combining graph neural networks with expert knowledge for SAT solver selection. In: KDD (2024)","DOI":"10.1145\/3637528.3671627"}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-21540-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T06:50:01Z","timestamp":1773903001000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-21540-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032215390","9783032215406"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-21540-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"20 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoIKS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Foundations of Information and Knowledge Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanover","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"foiks2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/foiks2026.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}