{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:01:24Z","timestamp":1743102084695,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031645280"},{"type":"electronic","value":"9783031645297"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-64529-7_19","type":"book-chapter","created":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T15:21:35Z","timestamp":1721143295000},"page":"186-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constrained Neural Networks for\u00a0Interpretable Heuristic Creation to\u00a0Optimise Computer Algebra Systems"],"prefix":"10.1007","author":[{"given":"Dorian","family":"Florescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"England","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,17]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Barredo Arrieta, A., et al.: Explainable artificial intelligence (XAI): concepts, taxonomies, opportunities and challenges toward responsible AI. Inf. Fusion 58, 82\u2013115 (2020). https:\/\/doi.org\/10.1016\/j.inffus.2019.12.012","DOI":"10.1016\/j.inffus.2019.12.012"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Bernal, E.A., Hauenstein, J.D., Mehta, D., Regan, M.H., Tang, T.: Machine learning the real discriminant locus. J. Symb. Comput. 115, 409\u2013426 (2023). https:\/\/doi.org\/10.1016\/j.jsc.2022.08.001","DOI":"10.1016\/j.jsc.2022.08.001"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Bradford, R., et al.: Identifying the parametric occurrence of multiple steady states for some biological networks. J. Symb. Comput. 98, 84\u2013119 (2020). https:\/\/doi.org\/10.1016\/j.jsc.2019.07.008","DOI":"10.1016\/j.jsc.2019.07.008"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-39320-4_2","volume-title":"Intelligent Computer Mathematics","author":"R Bradford","year":"2013","unstructured":"Bradford, R., Davenport, J.H., England, M., Wilson, D.: Optimising problem formulation for cylindrical algebraic decomposition. In: Carette, J., Aspinall, D., Lange, C., Sojka, P., Windsteiger, W. (eds.) CICM 2013. LNCS (LNAI), vol. 7961, pp. 19\u201334. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39320-4_2"},{"key":"19_CR5","unstructured":"Brown, C.W.: Companion to the tutorial: Cylindrical algebraic decomposition, ISSAC 2004 (2004). http:\/\/www.usna.edu\/Users\/cs\/wcbrown\/research\/ISSAC04\/handout.pdf"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Brown, C., Davenport, J.: The complexity of quantifier elimination and cylindrical algebraic decomposition. In: Proceedings ISSAC 2007, pp. 54\u201360. ACM (2007). https:\/\/doi.org\/10.1145\/1277548.1277557","DOI":"10.1145\/1277548.1277557"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Carette, J.: Understanding expression simplification. In: Proceedings of ISSAC 2004, pp. 72\u201379. ACM (2004). https:\/\/doi.org\/10.1145\/1005285.1005298","DOI":"10.1145\/1005285.1005298"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-030-52200-1_28","volume-title":"Mathematical Software \u2013 ICMS 2020","author":"C Chen","year":"2020","unstructured":"Chen, C., Zhu, Z., Chi, H.: Variable ordering selection for cylindrical algebraic decomposition with artificial neural networks. In: Bigatti, A.M., Carette, J., Davenport, J.H., Joswig, M., de Wolff, T. (eds.) ICMS 2020. LNCS, vol. 12097, pp. 281\u2013291. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52200-1_28"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages","author":"GE Collins","year":"1975","unstructured":"Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decompostion. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134\u2013183. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_17"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Davenport, J.H., Heintz, J.: Real quantifier elimination is doubly exponential. J. Symb. Comput. 5(1-2), 29\u201335 (1988). https:\/\/doi.org\/10.1016\/S0747-7171(88)80004-X","DOI":"10.1016\/S0747-7171(88)80004-X"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Davies, A., et al.: Advancing mathematics by guiding human intuition with AI. Nature 600, 70\u201374 (2021). https:\/\/doi.org\/10.1038\/s41586-021-04086-x","DOI":"10.1038\/s41586-021-04086-x"},{"key":"19_CR12","unstructured":"del R\u00edo, T., England, M.: Lessons on datasets and paradigms in machine learning for symbolic computation: a case study on CAD. Preprint (2024). https:\/\/doi.org\/10.48550\/arXiv.2401.13343"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"del R\u00edo, T., England, M.: New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis. In: Boulier, F. et al. (eds.), Proceedings of CASC 2022. LNCS, vol. 13366, pp. 300\u2013317. Springer International, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14788-3_17","DOI":"10.1007\/978-3-031-14788-3_17"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Dolzmann, A., Seidl, A., Sturm, T.: Efficient projection orders for CAD. In: Proceedings of ISSAC 2004, pp. 111\u2013118. ACM (2004). https:\/\/doi.org\/10.1145\/1005285.1005303","DOI":"10.1145\/1005285.1005303"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"England, M., Florescu, D.: Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition. In: Kaliszyk, C., et al. (eds.) Proceedings of CICM 2019. LNCS, vol. 11617, pp. 93\u2013108. Springer International, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23250-4_7","DOI":"10.1007\/978-3-030-23250-4_7"},{"key":"19_CR16","unstructured":"Florescu, D., England, M.: Algorithmically generating new algebraic features of polynomial systems for machine learning. In: Abbott, J., Griggio, A. (eds.) Proceedings of $$\\sf SC^2$$ 2019. CEUR-WS 2460 (2019). http:\/\/ceur-ws.org\/Vol-2460\/"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Florescu, D., England, M.: Improved cross-validation for classifiers that make algorithmic choices to minimise runtime without compromising output correctness. In: Slamanig, D., et al. (eds.), Proceedings of MACIS 2019. LNCS, vol. 11989, pp. 341\u2013356. Springer International, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43120-4_27","DOI":"10.1007\/978-3-030-43120-4_27"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Florescu, D., England, M.: A machine learning based software pipeline to pick the variable ordering for algorithms with polynomial inputs. In: Bigatti, A., et al. (eds.) Proceedings of ICMS 2020. LNCS, vol. 12097, pp. 302\u2013322. Springer International, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52200-1_30","DOI":"10.1007\/978-3-030-52200-1_30"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"He, Y.H.: Machine-learning mathematical structures. Int. J. Data Sci. Math. Sci. 1(1), 1\u201325 (2022). https:\/\/doi.org\/10.1142\/S2810939222500010","DOI":"10.1142\/S2810939222500010"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Herm, L.V., Heinrich, K., Wanner, J., Janiesch, C.: Stop ordering machine learning algorithms by their explainability! A user-centered investigation of performance and explainability. Int. J. Inf. Manage. 102538 (2022). https:\/\/doi.org\/10.1016\/j.ijinfomgt.2022.102538","DOI":"10.1016\/j.ijinfomgt.2022.102538"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Huang, Z., England, M., Davenport, J.H., Paulson, L.: Using machine learning to decide when to precondition cylindrical algebraic decomposition with Groebner bases. In: Proceeedings of SYNASC 2016, pp. 45\u201352. IEEE (2016). https:\/\/doi.org\/10.1109\/SYNASC.2016.020","DOI":"10.1109\/SYNASC.2016.020"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Huang, Z., England, M., Wilson, D., Davenport, J.H., Paulson, L., Bridge, J.: Applying machine learning to the problem of choosing a heuristic to select the variable ordering for cylindrical algebraic decomposition. In: Watt, S.M., et al. (eds.) Proceedings of CICM 2014. LNCS, vol. 8543, pp. 92\u2013107. Springer International, Cham (2014). http:\/\/dx.doi.org\/10.1007\/978-3-319-08434-3_8","DOI":"10.1007\/978-3-319-08434-3_8"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Kuipers, J., Ueda, T., Vermaseren, J.A.M.: Code optimization in FORM. Comput. Phys. Commun. 189, 1\u201319 (2015). https:\/\/doi.org\/10.1016\/j.cpc.2014.08.008","DOI":"10.1016\/j.cpc.2014.08.008"},{"key":"19_CR24","unstructured":"Lample, G., Charton, D.: Deep learning for symbolic mathematics. In: Mohamed, S., et al. (eds.) Proceedings ICLR 2020 (2020). https:\/\/iclr.cc\/virtual_2020\/poster_S1eZYeHFDS.html"},{"key":"19_CR25","unstructured":"Lundberg, S.M., Lee, S.I.: A unified approach to interpreting model predictions. In: Proceedings of NIPS 2017, pp. 4768\u20134777. Curran Associates Inc. (2017). https:\/\/dl.acm.org\/doi\/10.5555\/3295222.3295230"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Manubens, M., Moroz, G., Chablat, D., Rouillier, F., Wenger, P.: Cusp points in the parameter space of degenerate 3-RPR planar parallel manipulators. J. Mech. Robot. 4, 041003 (2012). https:\/\/doi.org\/10.1115\/1.4006921","DOI":"10.1115\/1.4006921"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Mulligan, C.B., Davenport, J.H., England, M.: TheoryGuru: a mathematica package to apply quantifier elimination technology to economics. In: Davenport, J.H. et al. (eds.) Proceedings of ICMS 2018, LNCS, vol. 10931, pp. 369\u2013378. Springer International, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96418-8_44","DOI":"10.1007\/978-3-319-96418-8_44"},{"key":"19_CR28","unstructured":"Peifer, D., Stillman, M., Halpern-Leistner, D.: Learning selection strategies in Buchberger\u2019s algorithm. In: Daum\u00e9 III, H., Singh, A. (eds.) Proceedings of ICML 2020. PMLR 119, pp. 7575\u20137585 (2020). https:\/\/proceedings.mlr.press\/v119\/peifer20a.html"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Pickering, L., Del Rio Almajano, T., England, M., Cohen, K.: Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition. J. Symb. Comput. 123, 102276 (2024). https:\/\/doi.org\/10.1016\/j.jsc.2023.102276","DOI":"10.1016\/j.jsc.2023.102276"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Romera-Paredes, B., et al.: Mathematical discoveries from program search with large language models. Nature 625, 468\u2013475 (2023). https:\/\/doi.org\/10.1038\/s41586-023-06924-6","DOI":"10.1038\/s41586-023-06924-6"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Rudin, C.: Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nat. Mach. Intell. 1(5), 206\u2013215 (2019). https:\/\/doi.org\/10.1038\/s42256-019-0048-x","DOI":"10.1038\/s42256-019-0048-x"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"Simpson, M.C., Yi, Q., Kalita, J.: Automatic algorithm selection in computational software using machine learning. In: Proceedings of ICMLA 2016, pp. 355\u2013360 (2016). https:\/\/doi.org\/10.1109\/ICMLA.2016.0064","DOI":"10.1109\/ICMLA.2016.0064"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Speith, T.: A review of taxonomies of explainable artificial intelligence (XAI) methods. In: Proceedings of FAccT 2022, pp. 2239\u20132250. ACM (2022). https:\/\/doi.org\/10.1145\/3531146.3534639","DOI":"10.1145\/3531146.3534639"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Wilson, D., England, M., Davenport, J.H., Bradford, R.: Using the distribution of cells by dimension in a cylindrical algebraic decomposition. In: Proceedings of SYNASC 2014, pp. 53\u201360. IEEE (2014). http:\/\/dx.doi.org\/10.1109\/SYNASC.2014.15","DOI":"10.1109\/SYNASC.2014.15"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64529-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T15:24:01Z","timestamp":1721143441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64529-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031645280","9783031645297"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64529-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Congress on Mathematical Software","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durham","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icms2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/maths.dur.ac.uk\/icms2024\/ICMS2024.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}