{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:28:38Z","timestamp":1753885718225,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031331695"},{"type":"electronic","value":"9783031331701"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33170-1_29","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"472-488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Satisfiability of\u00a0Non-linear Transcendental Arithmetic as\u00a0a\u00a0Certificate Search Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0428-4403","authenticated-orcid":false,"given":"Enrico","family":"Lipparini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1710-1513","authenticated-orcid":false,"given":"Stefan","family":"Ratschan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"issue":"205","key":"29_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1090\/S0025-5718-1994-1203731-4","volume":"62","author":"O Aberth","year":"1994","unstructured":"Aberth, O.: Computation of topological degree using interval arithmetic, and applications. Math. Comput. 62(205), 171\u2013178 (1994)","journal-title":"Math. Comput."},{"key":"29_CR2","unstructured":"Ait-Aoudia, S., J\u00e9gou, R., Michelucci, D.: Reduction of constraint systems. CoRR, abs\/1405.6131 (2014)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Bak, S., Bogomolov, S., Johnson, T.T.: HYST: a source transformation and translation tool for hybrid automaton models. In: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, HSCC 2015, New York, NY, USA, pp. 128\u2013133. Association for Computing Machinery (2015)","DOI":"10.1145\/2728606.2728630"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Barbosa, H., et al.: Flexible proof production in an industrial-strength SMT solver. In: Automated Reasoning: Proceedings of 11th International Joint Conference, IJCAR 2022, Haifa, Israel, 8\u201310 August 2022, pp. 15\u201335. Springer (2022)","DOI":"10.1007\/978-3-031-10769-6_3"},{"key":"29_CR5","doi-asserted-by":"publisher","unstructured":"Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 336, pp. 1267\u20131329 (2021). https:\/\/doi.org\/10.3233\/FAIA201017","DOI":"10.3233\/FAIA201017"},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-030-79876-5_7","volume-title":"Automated Deduction \u2013 CADE 28","author":"F Brau\u00dfe","year":"2021","unstructured":"Brau\u00dfe, F., Korovin, K., Korovina, M.V., M\u00fcller, N.T.: The ksmt calculus Is a $$\\delta $$-complete decision procedure for non-linear constraints. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 113\u2013130. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_7"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Cimatti, A., Griggio, A., Irfan, A., Roveri, M., Sebastiani, R.: Incremental linearization for satisfiability and verification modulo nonlinear arithmetic and transcendental functions. ACM Trans. Comput. Logic 19(3) (2018)","DOI":"10.1145\/3230639"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-36742-7_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Cimatti","year":"2013","unstructured":"Cimatti, A., Griggio, A., Schaafsma, B.J., Sebastiani, R.: The MathSAT5 SMT solver. In: Piterman, N., Smolka, S.A. (eds.) TACAS 2013. LNCS, vol. 7795, pp. 93\u2013107. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36742-7_7"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"517","DOI":"10.4153\/CJM-1958-052-0","volume":"10","author":"AL Dulmage","year":"1958","unstructured":"Dulmage, A.L., Mendelsohn, N.S.: Coverings of bipartite graphs. Can. J. Math. 10, 517\u2013534 (1958)","journal-title":"Can. J. Math."},{"key":"29_CR11","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198511960.001.0001","volume-title":"Degree Theory in Analysis and Applications","author":"I Fonseca","year":"1995","unstructured":"Fonseca, I., Gangbo, W.: Degree Theory in Analysis and Applications. Clarendon Press, Oxford (1995)"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1090\/S0025-5718-2014-02877-9","volume":"84","author":"P Franek","year":"2015","unstructured":"Franek, P., Ratschan, S.: Effective topological degree computation based on interval arithmetic. Math. Comput. 84, 1265\u20131290 (2015)","journal-title":"Math. Comput."},{"issue":"2","key":"29_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10817-015-9351-3","volume":"57","author":"P Franek","year":"2016","unstructured":"Franek, P., Ratschan, S., Zgliczynski, P.: Quasi-decidability of a fragment of the first-order theory of real numbers. J. Autom. Reason. 57(2), 157\u2013185 (2016)","journal-title":"J. Autom. Reason."},{"key":"29_CR14","first-page":"209","volume":"1","author":"M Fr\u00e4nzle","year":"2007","unstructured":"Fr\u00e4nzle, M., Herde, C., Teige, T., Ratschan, S., Schubert, T.: Efficient solving of large non-linear arithmetic constraint systems with complex Boolean structure. JSAT 1, 209\u2013236 (2007)","journal-title":"JSAT"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-41540-6_11","volume-title":"Computer Aided Verification","author":"Z Fu","year":"2016","unstructured":"Fu, Z., Su, Z.: XSat: a fast floating-point satisfiability solver. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 187\u2013209. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_11"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-38574-2_14","volume-title":"Automated Deduction \u2013 CADE-24","author":"S Gao","year":"2013","unstructured":"Gao, S., Kong, S., Clarke, E.M.: dReal: an SMT solver for nonlinear theories over the reals. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 208\u2013214. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38574-2_14"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Hall, P.: On representatives of subsets. J. London Math. Soc. s1-10(1), 26\u201330 (1935)","DOI":"10.1112\/jlms\/s1-10.37.26"},{"key":"29_CR18","volume-title":"Global Optimization Using Interval Analysis","author":"E Hansen","year":"1992","unstructured":"Hansen, E.: Global Optimization Using Interval Analysis. Marcel Dekker, New York (1992)"},{"issue":"1","key":"29_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF02680551","volume":"83","author":"RB Kearfott","year":"1998","unstructured":"Kearfott, R.B.: On proving existence of feasible points in equality constrained optimization problems. Math. Program. 83(1), 89\u2013100 (1998)","journal-title":"Math. Program."},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-031-10769-6_7","volume-title":"Automated Reasoning","author":"G Kremer","year":"2022","unstructured":"Kremer, G., Reynolds, A., Barrett, C., Tinelli, C.: Cooperating techniques for solving nonlinear real arithmetic in the cvc5 SMT solver (system description). In: Blanchette, J., Kov\u00e1cs, L., Pattinson, D. (eds.) IJCAR 2022. LNCS, vol. 13385, pp. 95\u2013105. Springer, Cham (2022)"},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-031-19992-9_9","volume-title":"Automated Technology for Verification and Analysis","author":"E Lipparini","year":"2022","unstructured":"Lipparini, E., Cimatti, A., Griggio, A., Sebastiani, R.: Handling polynomial and transcendental functions in SMT via unconstrained optimisation and topological degree test. In: Bouajjani, A., Hol\u00edk, L., Wu, Z. (eds.) ATVA 2022. LNCS, vol. 13505, pp. 137\u2013153. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-19992-9_9"},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0377-0427(94)00089-J","volume":"60","author":"G Mayer","year":"1994","unstructured":"Mayer, G.: Epsilon-inflation in verification algorithms. J. Comput. Appl. Math. 60, 147\u2013169 (1994)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"29_CR23","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.cosrev.2010.09.009","volume":"5","author":"RM McConnell","year":"2011","unstructured":"McConnell, R.M., Mehlhorn, K., N\u00e4her, S., Schweitzer, P.: Certifying algorithms. Comput. Sci. Rev. 5(2), 119\u2013161 (2011)","journal-title":"Comput. Sci. Rev."},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. SIAM (2009)","DOI":"10.1137\/1.9780898717716"},{"key":"29_CR25","volume-title":"Interval Methods for Systems of Equations","author":"A Neumaier","year":"1990","unstructured":"Neumaier, A.: Interval Methods for Systems of Equations. Cambridge University Press, Cambridge (1990)"},{"issue":"4","key":"29_CR26","doi-asserted-by":"publisher","first-page":"514","DOI":"10.2307\/2271358","volume":"33","author":"D Richardson","year":"1968","unstructured":"Richardson, D.: Some undecidable problems involving elementary functions of a real variable. J. Symb. Log. 33(4), 514\u2013520 (1968)","journal-title":"J. Symb. Log."},{"key":"29_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/978-3-662-54577-5_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N Roohi","year":"2017","unstructured":"Roohi, N., Prabhakar, P., Viswanathan, M.: HARE: a hybrid abstraction refinement engine for verifying non-linear hybrid automata. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 573\u2013588. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_33"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Rump, S.M.: Verification methods: rigorous results using floating-point arithmetic. Acta Numer. 287\u2013449 (2010)","DOI":"10.1017\/S096249291000005X"},{"issue":"3","key":"29_CR29","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/s10703-017-0284-9","volume":"51","author":"VX Tung","year":"2017","unstructured":"Tung, V.X., Van Khanh, T., Ogawa, M.: raSAT: an SMT solver for polynomial constraints. Formal Methods Syst. Design 51(3), 462\u2013499 (2017). https:\/\/doi.org\/10.1007\/s10703-017-0284-9","journal-title":"Formal Methods Syst. Design"},{"issue":"28","key":"29_CR30","doi-asserted-by":"publisher","first-page":"5111","DOI":"10.1021\/jp970984n","volume":"101","author":"DJ Wales","year":"1997","unstructured":"Wales, D.J., Doye, J.P.K.: Global optimization by basin-hopping and the lowest energy structures of Lennard-Jones clusters containing up to 110 atoms. J. Phys. Chem. A 101(28), 5111\u20135116 (1997)","journal-title":"J. Phys. Chem. A"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33170-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T16:00:11Z","timestamp":1702569611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Houston, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/nfm-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}