{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T05:07:55Z","timestamp":1778562475357,"version":"3.51.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030284220","type":"print"},{"value":"9783030284237","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-28423-7_6","type":"book-chapter","created":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T07:22:46Z","timestamp":1564730566000},"page":"85-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Evaluating Branching Heuristics in Interval Constraint Propagation for Satisfiability"],"prefix":"10.1007","author":[{"given":"Calvin","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soonho","family":"Kong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sicun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3197-8736","authenticated-orcid":false,"given":"Damien","family":"Zufferey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,3]]},"reference":[{"key":"6_CR1","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2019). \n                      www.smtlib.org\/"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/11564751_9","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"H Batnini","year":"2005","unstructured":"Batnini, H., Michel, C., Rueher, M.: Mind the gaps: a new splitting strategy for consistency techniques. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 77\u201391. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11564751_9"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1016\/S1574-6526(06)80020-9","volume-title":"Handbook of Constraint Programming","author":"Fr\u00e9d\u00e9ric Benhamou","year":"2006","unstructured":"Benhamou, F., Granvilliers, L.: Continuous and interval constraints. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, Chap. 16. Elsevier (2006)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-319-24318-4_29","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"A Biere","year":"2015","unstructured":"Biere, A., Fr\u00f6hlich, A.: Evaluating CDCL variable scoring schemes. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 405\u2013422. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-24318-4_29"},{"issue":"3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1137\/S0036142995281528","volume":"34","author":"T Csendes","year":"1997","unstructured":"Csendes, T., Ratz, D.: Subdivision direction selection in interval methods for global optimization. SIAM J. Numer. Anal. 34(3), 922\u2013938 (1997). \n                      https:\/\/doi.org\/10.1137\/S0036142995281528","journal-title":"SIAM J. Numer. Anal."},{"issue":"3\u20134","key":"6_CR6","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(3\u20134), 209\u2013236 (2007)","journal-title":"JSAT"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-642-31365-3_23","volume-title":"Automated Reasoning","author":"S Gao","year":"2012","unstructured":"Gao, S., Avigad, J., Clarke, E.M.: \n                      \n                        \n                      \n                      $$\\delta $$\n                      \n                        \n                          \u03b4\n                        \n                      \n                    -complete decision procedures for satisfiability\u00a0over\u00a0the reals. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 286\u2013300. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-31365-3_23"},{"key":"6_CR8","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-38574-2_14"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Gao, S., Kong, S., Clarke, E.M.: Proof generation from detla-decisions. In: Winkler, F., et al. (eds.) 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2014, Timisoara, Romania, 22\u201325 September 2014, pp. 156\u2013163. IEEE Computer Society (2014). \n                      https:\/\/doi.org\/10.1109\/SYNASC.2014.29","DOI":"10.1109\/SYNASC.2014.29"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-33558-7_23","volume-title":"Principles and Practice of Constraint Programming","author":"L Granvilliers","year":"2012","unstructured":"Granvilliers, L.: Adaptive bisection of numerical CSPs. In: Milano, M. (ed.) CP 2012. LNCS, pp. 290\u2013298. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-33558-7_23"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"e2","DOI":"10.1017\/fmp.2017.1","volume":"5","author":"TC Hales","year":"2017","unstructured":"Hales, T.C., et al.: A formal proof of the Kepler conjecture. Forum Math. Pi 5, e2 (2017). \n                      https:\/\/doi.org\/10.1017\/fmp.2017.1","journal-title":"Forum Math. Pi"},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10732-010-9134-2","volume":"17","author":"Y Hamadi","year":"2011","unstructured":"Hamadi, Y., Ringwelski, G.: Boosting distributed constraint satisfaction. J. Heuristics 17(3), 251\u2013279 (2011). \n                      https:\/\/doi.org\/10.1007\/s10732-010-9134-2","journal-title":"J. Heuristics"},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1145\/78928.78931","volume":"16","author":"RB Kearfott","year":"1990","unstructured":"Kearfott, R.B., Novoa, M.: Algorithm 681: INTBIS, a portable interval Newton\/bisection package. ACM Trans. Math. Softw. 16(2), 152\u2013157 (1990). \n                      https:\/\/doi.org\/10.1145\/78928.78931","journal-title":"ACM Trans. Math. Softw."},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Design Automation Conference, pp. 530\u2013535 (2001). \n                      https:\/\/doi.org\/10.1145\/378239.379017","DOI":"10.1145\/378239.379017"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF00288958","volume":"15","author":"PW Purdom","year":"1981","unstructured":"Purdom, P.W., Brown, C.A., Robertson, E.L.: Backtracking with multi-level dynamic search rearrangement. Acta Inf. 15(2), 99\u2013113 (1981). \n                      https:\/\/doi.org\/10.1007\/BF00288958","journal-title":"Acta Inf."},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Reyes, V., Araya, I.: Probing-based variable selection heuristics for NCSPs. In: 2014 IEEE 26th International Conference on Tools with Artificial Intelligence, pp. 16\u201323, November 2014. \n                      https:\/\/doi.org\/10.1109\/ICTAI.2014.14","DOI":"10.1109\/ICTAI.2014.14"},{"key":"6_CR17","volume-title":"Handbook of Constraint Programming","year":"2006","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, New York (2006)"},{"key":"6_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/b105200","volume-title":"Practical Mathematical Optimization: An Introduction to Basic Optimization Theory and Classical and New Gradient-Based Algorithms","author":"J Snyman","year":"2005","unstructured":"Snyman, J.: Practical Mathematical Optimization: An Introduction to Basic Optimization Theory and Classical and New Gradient-Based Algorithms. Springer, New York (2005). \n                      https:\/\/doi.org\/10.1007\/b105200"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Stanley-Marbell, P., Francese, P.A., Rinard, M.: Encoder logic for reducing serial I\/O power in sensors and sensor hubs. In: 2016 IEEE Hot Chips 28 Symposium (HCS), Cupertino, CA, USA, 21\u201323 August 2016, pp. 1\u20132. IEEE (2016). \n                      https:\/\/doi.org\/10.1109\/HOTCHIPS.2016.7936231","DOI":"10.1109\/HOTCHIPS.2016.7936231"},{"key":"6_CR20","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis: An Introduction","author":"K Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis: An Introduction. Texts in Theoretical Computer Science. Springer, Heidelberg (2000). \n                      https:\/\/doi.org\/10.1007\/978-3-642-56999-9"}],"container-title":["Lecture Notes in Computer Science","Numerical Software Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-28423-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T07:30:29Z","timestamp":1564731029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-28423-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030284220","9783030284237"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28423-7_6","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 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NSV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Numerical Software Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 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":"nsv2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nsv19.mpi-sws.org\/","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":"10","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":"5","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":"50% - 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":"1.1","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 invited papers related to tutorials presented at the workshop.","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)"}}]}}