{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:58:21Z","timestamp":1776333501740,"version":"3.51.2"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030232498","type":"print"},{"value":"9783030232504","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23250-4_7","type":"book-chapter","created":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T07:01:17Z","timestamp":1562050877000},"page":"93-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Comparing Machine Learning Models to Choose the Variable Ordering for Cylindrical Algebraic Decomposition"],"prefix":"10.1007","author":[{"given":"Matthew","family":"England","sequence":"first","affiliation":[]},{"given":"Dorian","family":"Florescu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,3]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-42547-4_3","volume-title":"Intelligent Computer Mathematics","author":"E \u00c1brah\u00e1m","year":"2016","unstructured":"\u00c1brah\u00e1m, E., et al.: \n                    \n                      \n                    \n                    $${\\sf SC^ 2}$$\n                  : satisfiability checking meets symbolic computation. In: Kohlhase, M., Johansson, M., Miller, B., de de Moura, L., Tompa, F. (eds.) CICM 2016. LNCS (LNAI), vol. 9791, pp. 28\u201343. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-42547-4_3"},{"key":"7_CR2","unstructured":"Alemi, A., Chollet, F., Een, N., Irving, G., Szegedy, C., Urban, J.: DeepMath-deep sequence models for premise selection. In: Proceedings of the 30th International Conference on Neural Information Processing Systems, NIPS 2016, pp. 2243\u20132251, Curran Associates Inc. (2016). \n                    https:\/\/papers.nips.cc\/paper\/6280-deepmath-deep-sequence-models-for-premise-selection.pdf"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0213054","volume":"13","author":"D Arnon","year":"1984","unstructured":"Arnon, D., Collins, G., McCallum, S.: Cylindrical algebraic decomposition I: the basic algorithm. SIAM J. Comput. 13, 865\u2013877 (1984). \n                    https:\/\/doi.org\/10.1137\/0213054","journal-title":"SIAM J. Comput."},{"key":"7_CR4","unstructured":"Barrett, C., Sebastiani, R., Seshia, S., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, Chap. 26, vol. 185 pp. 825\u2013885. IOS Press (2009)"},{"key":"7_CR5","volume-title":"Pattern Recognition and Machine Learning","author":"C Bishop","year":"2006","unstructured":"Bishop, C.: Pattern Recognition and Machine Learning. Springer, New York (2006)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-319-10515-4_4","volume-title":"Computer Algebra in Scientific Computing","author":"R Bradford","year":"2014","unstructured":"Bradford, R., Chen, C., Davenport, J.H., England, M., Moreno Maza, M., Wilson, D.: Truth table invariant cylindrical algebraic decomposition by regular chains. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2014. LNCS, vol. 8660, pp. 44\u201358. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-10515-4_4"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Bradford, R., et al.: A case study on the parametric occurrence of multiple steady states. In: Proceedings of the 42nd International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, pp. 45\u201352. ACM (2017). \n                    https:\/\/doi.org\/10.1145\/3087604.3087622","DOI":"10.1145\/3087604.3087622"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Bradford, R., Davenport, J., England, M., McCallum, S., Wilson, D.: Cylindrical algebraic decompositions for Boolean combinations. In: Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, ISSAC 2013, pp. 125\u2013132. ACM (2013). \n                    https:\/\/doi.org\/10.1145\/2465506.2465516","DOI":"10.1145\/2465506.2465516"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jsc.2015.11.002","volume":"76","author":"R Bradford","year":"2016","unstructured":"Bradford, R., Davenport, J., England, M., McCallum, S., Wilson, D.: Truth table invariant cylindrical algebraic decomposition. J. Symb. Comput. 76, 1\u201335 (2016). \n                    https:\/\/doi.org\/10.1016\/j.jsc.2015.11.002","journal-title":"J. Symb. Comput."},{"key":"7_CR10","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). \n                    https:\/\/doi.org\/10.1007\/978-3-642-39320-4_2"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10817-014-9301-5","volume":"53","author":"J Bridge","year":"2014","unstructured":"Bridge, J., Holden, S., Paulson, L.: Machine learning for first-order theorem proving. J. Autom. Reason. 53, 141\u2013172 (2014). 10.1007\/s10817-014-9301-5","journal-title":"J. Autom. Reason."},{"issue":"5","key":"7_CR12","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1006\/jsco.2001.0463","volume":"32","author":"C Brown","year":"2001","unstructured":"Brown, C.: Improved projection for cylindrical algebraic decomposition. J. Symb. Comput. 32(5), 447\u2013465 (2001). \n                    https:\/\/doi.org\/10.1006\/jsco.2001.0463","journal-title":"J. Symb. Comput."},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/968708.968710","volume":"37","author":"C Brown","year":"2003","unstructured":"Brown, C.: QEPCAD B: a program for computing with semi-algebraic sets using CADs. ACM SIGSAM Bull. 37(4), 97\u2013108 (2003). \n                    https:\/\/doi.org\/10.1145\/968708.968710","journal-title":"ACM SIGSAM Bull."},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Brown, C., Davenport, J.: The complexity of quantifier elimination and cylindrical algebraic decomposition. In: Proceedings of the 32nd International Symposium on Symbolic and Algebraic Computation, ISSAC 2007, pp. 54\u201360. ACM (2007). \n                    https:\/\/doi.org\/10.1145\/1277548.1277557","DOI":"10.1145\/1277548.1277557"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.jsc.2014.09.024","volume":"70","author":"C Brown","year":"2015","unstructured":"Brown, C., Kosta, M.: Constructing a single cell in cylindrical algebraic decomposition. J. Symb. Comput. 70, 14\u201348 (2015). \n                    https:\/\/doi.org\/10.1016\/j.jsc.2014.09.024","journal-title":"J. Symb. Comput."},{"key":"7_CR16","series-title":"Texts and Monographs in Symbolic Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9459-1","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","author":"B Caviness","year":"1998","unstructured":"Caviness, B., Johnson, J.: Quantifier Elimination and Cylindrical Algebraic Decomposition. TEXTSMONOGR. Springer, Vienna (1998). \n                    https:\/\/doi.org\/10.1007\/978-3-7091-9459-1"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-662-43799-5_17","volume-title":"Computer Mathematics","author":"C Chen","year":"2014","unstructured":"Chen, C., Moreno Maza, M.: An incremental algorithm for computing cylindrical algebraic decompositions. In: Feng, R., Lee, W., Sato, Y. (eds.) Computer Mathematics. LNCS (LNAI), pp. 199\u2013221. Springer, Heidelberg (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-662-43799-5_17"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Chen, C., Moreno Maza, M., Xia, B., Yang, L.: Computing cylindrical algebraic decomposition via triangular decomposition. In: Proceedings of the 34th International Symposium on Symbolic and Algebraic Computation, ISSAC 2009, pp. 95\u2013102. ACM (2009). \n                    https:\/\/doi.org\/10.1145\/1576702.1576718","DOI":"10.1145\/1576702.1576718"},{"key":"7_CR19","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 2nd GI Conference Kaiserslautern, May 20\u201323, 1975","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). \n                    https:\/\/doi.org\/10.1007\/3-540-07407-4_17"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0747-7171(08)80152-6","volume":"12","author":"G Collins","year":"1991","unstructured":"Collins, G., Hong, H.: Partial cylindrical algebraic decomposition for quantifier elimination. J. Symb. Comput. 12, 299\u2013328 (1991). \n                    https:\/\/doi.org\/10.1016\/S0747-7171(08)80152-6","journal-title":"J. Symb. Comput."},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Davenport, J., Bradford, R., England, M., Wilson, D.: Program verification in the presence of complex numbers, functions with branch cuts etc. In: 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2012, pp. 83\u201388. IEEE (2012). \n                    https:\/\/doi.org\/10.1109\/SYNASC.2012.68","DOI":"10.1109\/SYNASC.2012.68"},{"issue":"1\u20132","key":"7_CR22","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0747-7171(88)80004-X","volume":"5","author":"J Davenport","year":"1988","unstructured":"Davenport, J., Heintz, J.: Real quantifier elimination is doubly exponential. J. Symb. Comput. 5(1\u20132), 29\u201335 (1988). \n                    https:\/\/doi.org\/10.1016\/S0747-7171(88)80004-X","journal-title":"J. Symb. Comput."},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Dolzmann, A., Seidl, A., Sturm, T.: Efficient projection orders for CAD. In: Proceedings of the 29th International Symposium on Symbolic and Algebraic Computation, ISSAC 2004, pp. 111\u2013118. ACM (2004). \n                    https:\/\/doi.org\/10.1145\/1005285.1005303","DOI":"10.1145\/1005285.1005303"},{"issue":"2","key":"7_CR24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/261320.261324","volume":"31","author":"A Dolzmann","year":"1997","unstructured":"Dolzmann, A., Sturm, T.: REDLOG: computer algebra meets computer logic. SIGSAM Bull. 31(2), 2\u20139 (1997). \n                    https:\/\/doi.org\/10.1145\/261320.261324","journal-title":"SIGSAM Bull."},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-96418-8_20","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"M England","year":"2018","unstructured":"England, M.: Machine learning for mathematical software. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 165\u2013174. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-96418-8_20"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-08434-3_5","volume-title":"Intelligent Computer Mathematics","author":"M England","year":"2014","unstructured":"England, M., Bradford, R., Chen, C., Davenport, J.H., Maza, M.M., Wilson, D.: Problem formulation for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition. In: Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS (LNAI), vol. 8543, pp. 45\u201360. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-08434-3_5"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"England, M., Bradford, R., Davenport, J.: Improving the use of equational constraints in cylindrical algebraic decomposition. In: Proceedings of the 40th International Symposium on Symbolic and Algebraic Computation, ISSAC 2015, pp. 165\u2013172. ACM (2015). \n                    https:\/\/doi.org\/10.1145\/2755996.2756678","DOI":"10.1145\/2755996.2756678"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-662-44199-2_68","volume-title":"Mathematical Software \u2013 ICMS 2014","author":"M England","year":"2014","unstructured":"England, M., Bradford, R., Davenport, J.H., Wilson, D.: Choosing a variable ordering for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 450\u2013457. Springer, Heidelberg (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-662-44199-2_68"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-319-66320-3_8","volume-title":"Computer Algebra in Scientific Computing","author":"M England","year":"2017","unstructured":"England, M., Errami, H., Grigoriev, D., Radulescu, O., Sturm, T., Weber, A.: Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2017. LNCS, vol. 10490, pp. 93\u2013108. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-66320-3_8"},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-662-44199-2_69","volume-title":"Mathematical Software \u2013 ICMS 2014","author":"M England","year":"2014","unstructured":"England, M., Wilson, D., Bradford, R., Davenport, J.H.: Using the regular chains library to build cylindrical algebraic decompositions by projecting and lifting. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 458\u2013465. Springer, Heidelberg (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-662-44199-2_69"},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.jsc.2015.11.010","volume":"75","author":"M Erascu","year":"2016","unstructured":"Erascu, M., Hong, H.: Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation). J. Symb. Comput. 75, 110\u2013126 (2016). \n                    https:\/\/doi.org\/10.1016\/j.jsc.2015.11.010","journal-title":"J. Symb. Comput."},{"key":"7_CR32","unstructured":"Graebe, H., Nareike, A., Johanning, S.: The SymbolicData project: towards a computer algebra social network. In: England, M., et al. (eds.) Joint Proceedings of the MathUI, OpenMath and ThEdu Workshops and Work in Progress track at CICM. CEUR Workshop Proceedings, vol. 1186 (2014). \n                    http:\/\/ceur-ws.org\/Vol-1186\/#paper-21"},{"issue":"1","key":"7_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2768577.2768578","volume":"49","author":"A Heinle","year":"2015","unstructured":"Heinle, A., Levandovskyy, V.: The SDEval benchmarking toolkit. ACM Commun. Comput. Algebra 49(1), 1\u20139 (2015). \n                    https:\/\/doi.org\/10.1145\/2768577.2768578","journal-title":"ACM Commun. Comput. Algebra"},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Hong, H.: An improvement of the projection operator in cylindrical algebraic decomposition. In: Proceedings of the 15th International Symposium on Symbolic and Algebraic Computation, ISSAC 1990, pp. 261\u2013264. ACM (1990), \n                    https:\/\/doi.org\/10.1145\/96877.96943","DOI":"10.1145\/96877.96943"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Huang, Z., England, M., Davenport, J., Paulson, L.: Using machine learning to decide when to precondition cylindrical algebraic decomposition with Groebner bases. In: 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2016), pp. 45\u201352. IEEE (2016). \n                    https:\/\/doi.org\/10.1109\/SYNASC.2016.020","DOI":"10.1109\/SYNASC.2016.020"},{"key":"7_CR36","doi-asserted-by":"publisher","unstructured":"Huang, Z., England, M., Wilson, D., Bridge, J., Davenport, J.H., Paulson, L.: Using machine learning to improve cylindrical algebraic decomposition. Math. Comput. Sci. (2019). \n                    https:\/\/doi.org\/10.1007\/s11786-019-00394-8","DOI":"10.1007\/s11786-019-00394-8"},{"key":"7_CR37","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-319-08434-3_8","volume-title":"Intelligent Computer Mathematics","author":"Z Huang","year":"2014","unstructured":"Huang, Z., England, M., Wilson, D., Davenport, J.H., Paulson, L.C., 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., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS (LNAI), vol. 8543, pp. 92\u2013107. Springer, Cham (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-319-08434-3_8"},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"Iwane, H., Yanami, H., Anai, H., Yokoyama, K.: An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination. In: Proceedings of the 2009 Conference on Symbolic Numeric Computation, SNC 2009, pp. 55\u201364 (2009). \n                    https:\/\/doi.org\/10.1145\/1577190.1577203","DOI":"10.1145\/1577190.1577203"},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-31365-3_27","volume-title":"Automated Reasoning","author":"D Jovanovi\u0107","year":"2012","unstructured":"Jovanovi\u0107, D., de Moura, L.: Solving non-linear arithmetic. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 339\u2013354. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-31365-3_27"},{"key":"7_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-32859-1_21","volume-title":"Mathematical Aspects of Computer and Information Sciences","author":"M Kobayashi","year":"2016","unstructured":"Kobayashi, M., Iwane, H., Matsuzaki, T., Anai, H.: Efficient subformula orders for real quantifier elimination of non-prenex formulas. In: Kotsireas, I.S., Rump, S.M., Yap, C.K. (eds.) MACIS 2015. LNCS, vol. 9582, pp. 236\u2013251. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-32859-1_21"},{"key":"7_CR41","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). \n                    https:\/\/doi.org\/10.1007\/978-3-642-39634-2_6"},{"key":"7_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-66263-3_8","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"JH Liang","year":"2017","unstructured":"Liang, J.H., Hari Govind, V.K., Poupart, P., Czarnecki, K., Ganesh, V.: An empirical study of branching heuristics through the lens of global learning rate. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 119\u2013135. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-66263-3_8"},{"key":"7_CR43","series-title":"Texts and Monographs in Symbolic Computation","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-7091-9459-1_12","volume-title":"Quantifier Elimination and Cylindrical Algebraic Decomposition","author":"S McCallum","year":"1998","unstructured":"McCallum, S.: An improved projection operation for cylindrical algebraic decomposition. In: Caviness, B.F., Johnson, J.R. (eds.) Quantifier Elimination and Cylindrical Algebraic Decomposition. TEXTSMONOGR, pp. 242\u2013268. Springer, Vienna (1998). \n                    https:\/\/doi.org\/10.1007\/978-3-7091-9459-1_12"},{"key":"7_CR44","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.jsc.2017.12.002","volume":"92","author":"S McCallum","year":"2019","unstructured":"McCallum, S., Parusi\u0144iski, A., Paunescu, L.: Validity proof of Lazard\u2019s method for CAD construction. J. Symb. Comput. 92, 52\u201369 (2019). \n                    https:\/\/doi.org\/10.1016\/j.jsc.2017.12.002","journal-title":"J. Symb. Comput."},{"key":"7_CR45","doi-asserted-by":"crossref","unstructured":"Mulligan, C., Bradford, R., Davenport, J., England, M., Tonks, Z.: Non-linear real arithmetic benchmarks derived from automated reasoning in economics. In: Bigatti, A., Brain, M. (eds.) Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation (\n                    \n                      \n                    \n                    $${{\\sf SC}}^2$$\n                   2018). CEUR Workshop Proceedings, vol. 2189, pp. 48\u201360 (2018). \n                    http:\/\/ceur-ws.org\/Vol-2189\/","DOI":"10.3386\/w24602"},{"key":"7_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-319-96418-8_44","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"CB Mulligan","year":"2018","unstructured":"Mulligan, C.B., Davenport, J.H., England, M.: TheoryGuru: a mathematica package to apply quantifier elimination technology to economics. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 369\u2013378. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-96418-8_44"},{"key":"7_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-32347-8_1","volume-title":"Interactive Theorem Proving","author":"LC Paulson","year":"2012","unstructured":"Paulson, L.C.: MetiTarski: past and future. In: Beringer, L., Felty, A. (eds.) ITP 2012. LNCS, vol. 7406, pp. 1\u201310. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-32347-8_1"},{"key":"7_CR48","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011). \n                    http:\/\/www.jmlr.org\/papers\/v12\/pedregosa11a.html","journal-title":"J. Mach. Learn. Res."},{"key":"7_CR49","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-642-02959-2_35","volume-title":"Automated Deduction \u2013 CADE-22","author":"A Platzer","year":"2009","unstructured":"Platzer, A., Quesel, J.-D., R\u00fcmmer, P.: Real world verification. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 485\u2013501. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-02959-2_35"},{"issue":"9","key":"7_CR50","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1016\/j.jsc.2006.06.004","volume":"41","author":"A Strzebo\u0144ski","year":"2006","unstructured":"Strzebo\u0144ski, A.: Cylindrical algebraic decomposition using validated numerics. J. Symb. Comput. 41(9), 1021\u20131038 (2006). \n                    https:\/\/doi.org\/10.1016\/j.jsc.2006.06.004","journal-title":"J. Symb. Comput."},{"key":"7_CR51","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jsc.2015.11.018","volume":"76","author":"A Strzebo\u0144ski","year":"2016","unstructured":"Strzebo\u0144ski, A.: Cylindrical algebraic decomposition using local projections. J. Symb. Comput. 76, 36\u201364 (2016). \n                    https:\/\/doi.org\/10.1016\/j.jsc.2015.11.018","journal-title":"J. Symb. Comput."},{"key":"7_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/11870814_25","volume-title":"Computer Algebra in Scientific Computing","author":"T Sturm","year":"2006","unstructured":"Sturm, T.: New domains for applied quantifier elimination. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2006. LNCS, vol. 4194, pp. 295\u2013301. Springer, Heidelberg (2006). \n                    https:\/\/doi.org\/10.1007\/11870814_25"},{"key":"7_CR53","unstructured":"Tarski, A.: A decision method for elementary algebra and geometry. RAND Corporation, Santa Monica, CA (reprinted in the collection [16]) (1948)"},{"key":"7_CR54","unstructured":"Urban, J.: MaLARea: a metasystem for automated reasoning in large theories. In: Empirically Successful Automated Reasoning in Large Theories (ESARLT 2007). CEUR Workshop Proceedings, vol. 257, p. 14 (2007). \n                    http:\/\/ceur-ws.org\/Vol-257\/"},{"key":"7_CR55","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s11786-014-0191-z","volume":"8","author":"D Wilson","year":"2014","unstructured":"Wilson, D., Bradford, R., Davenport, J., England, M.: Cylindrical algebraic subdecompositions. Math. Comput. Sci. 8, 263\u2013288 (2014). \n                    https:\/\/doi.org\/10.1007\/s11786-014-0191-z","journal-title":"Math. Comput. Sci."},{"key":"7_CR56","doi-asserted-by":"publisher","unstructured":"Wilson, D., Davenport, J., England, M., Bradford, R.: A \u201cpiano movers\u201d problem reformulated. In: 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2013, pp. 53\u201360. IEEE (2013). \n                    https:\/\/doi.org\/10.1109\/SYNASC.2013.14","DOI":"10.1109\/SYNASC.2013.14"},{"key":"7_CR57","doi-asserted-by":"publisher","unstructured":"Wilson, D., England, M., Davenport, J., Bradford, R.: Using the distribution of cells by dimension in a cylindrical algebraic decomposition. In: 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014, pp. 53\u201360. IEEE (2014). \n                    https:\/\/doi.org\/10.1109\/SYNASC.2014.15","DOI":"10.1109\/SYNASC.2014.15"},{"issue":"3","key":"7_CR58","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/2429135.2429137","volume":"46","author":"D Wilson","year":"2012","unstructured":"Wilson, D., Bradford, R., Davenport, J.: A repository for CAD examples. ACM Commun. Comput. Algebra 46(3), 67\u201369 (2012). \n                    https:\/\/doi.org\/10.1145\/2429135.2429137","journal-title":"ACM Commun. Comput. Algebra"},{"key":"7_CR59","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: SATzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565\u2013606 (2008). \n                    https:\/\/doi.org\/10.1613\/jair.2490","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23250-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T07:04:14Z","timestamp":1562051054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-23250-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232498","9783030232504"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23250-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 July 2019","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":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2019\/cicm.php?event=&menu=general","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}