{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:19:30Z","timestamp":1743092370565,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030634605"},{"type":"electronic","value":"9783030634612"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-63461-2_21","type":"book-chapter","created":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T16:03:28Z","timestamp":1605283408000},"page":"387-394","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reformulation of SAT into a Polynomial Box-Constrained Optimization Problem"],"prefix":"10.1007","author":[{"given":"St\u00e9phane","family":"Jacquet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Hall\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,13]]},"reference":[{"key":"21_CR1","series-title":"Springer series in operations research and financial engineering","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-Free and Blackbox Optimization","author":"C Audet","year":"2017","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. SSORFE. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68913-5"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1093\/biomet\/ast062","volume":"101","author":"J Chen","year":"2014","unstructured":"Chen, J., Qian, P.Z.G.: Latin hypercube designs with controlled correlations and multi-dimensional stratification. Biometrika 101(2), 319\u2013332 (2014)","journal-title":"Biometrika"},{"key":"21_CR3","unstructured":"Cont, R., Heidari, M.: Optimal rounding under integer constraints. CoRR, abs\/1501.00014 (2015)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.jsc.2018.06.018","volume":"91","author":"M Dressler","year":"2019","unstructured":"Dressler, M., Iliman, S., de Wolff, T.: An approach to constrained polynomial optimization via nonnegative circuit polynomials and geometric programming. J. Symb. Comput. 91, 149\u2013172 (2019)","journal-title":"J. Symb. Comput."},{"key":"21_CR5","unstructured":"Duda, J.: P =? NP as minimization of degree 4 polynomial, or Grassmann number problem. CoRR, abs\/1703.04456 (2017)"},{"key":"21_CR6","unstructured":"Fang, C., Liu, A.: A linear algebra formulation for boolean satisfiability testing. CoRR, abs\/1701.02401 (2017)"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1109\/69.334864","volume":"6","author":"J Gu","year":"1994","unstructured":"Gu, J.: Global optimization for satisfiability (SAT) problem. IEEE Trans. Knowl. Data Eng. 6(3), 361\u2013381 (1994)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"21_CR8","unstructured":"Inala, J.P., Gao, S., Kong, S., Solar-Lezama, A.: REAS: combining numerical optimization with SAT solving. CoRR, abs\/1802.04408 (2018)"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"R. M. Karp. Reducibility among Combinatorial Problems, pages 85\u2013103. Springer, US, Boston, MA, 1972","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"21_CR10","unstructured":"Li, Z.: Polynomial optimization problems. PhD thesis, The Chinese University of Hong Kong (2011)"},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308\u2013313 (1965)","journal-title":"Comput. J."},{"key":"21_CR12","unstructured":"Ruder, S.: An overview of gradient descent optimization algorithms. CoRR, abs\/1609.04747 (2016)"},{"key":"21_CR13","unstructured":"Thengade, A., Dondal, R.: Genetic algorithm - survey paper. In: IJCA Proceeding National Conference on Recent Trends in Computing, NCRTC, 5, January 2012"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63461-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T16:38:55Z","timestamp":1605285535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-63461-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030634605","9783030634612"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63461-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lugano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ifm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ifm20.si.usi.ch\/","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":"64","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":"24","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":"2","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":"38% - 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","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,5","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)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}