{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:31Z","timestamp":1742913991031,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"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_27","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"447-463","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Linear Weight Transfer Rule for Local Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8429-2108","authenticated-orcid":false,"given":"Md Solimul","family":"Chowdhury","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3588-4873","authenticated-orcid":false,"given":"Cayden R.","family":"Codel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5587-8801","authenticated-orcid":false,"given":"Marijn J. H.","family":"Heule","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"27_CR1","unstructured":"Aaron Stump, Geoff Sutcliffe, C.T.: StarExec. https:\/\/www.starexec.org\/starexec\/public\/about.jsp (2013)"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.dam.2014.05.007","volume":"174","author":"T Ahmed","year":"2014","unstructured":"Ahmed, T., Kullmann, O., Snevily, H.S.: On the van der Waerden numbers w(2; 3, t). Discrete Applied Mathematics 174, 27\u201351 (2014). https:\/\/doi.org\/10.1016\/j.dam.2014.05.007","journal-title":"Discrete Applied Mathematics"},{"key":"27_CR3","unstructured":"Balint, A.: Engineering stochastic local search for the satisfiability problem. Ph.D. thesis, University of Ulm (2014)"},{"key":"27_CR4","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications. IOS Press, Amsterdam, The Netherlands (2009)"},{"key":"27_CR5","unstructured":"Biere, A.: YalSAT Yet Another Local Search Solver. http:\/\/fmv.jku.at\/yalsat\/ (2010)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Brown, S., Buitrago, P., Hanna, E., Sanielevici, S., Scibek, R., Nystrom, N.: Bridges-2: A platform for rapidly-evolving and data intensive research. In: Association for Computing Machinery, New York, NY, USA. pp. 1\u20134 (2021)","DOI":"10.1145\/3437359.3465593"},{"key":"27_CR7","first-page":"1","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2015","author":"S Cai","year":"2015","unstructured":"Cai, S., Luo, C., Su, K.: CCAnr: A configuration checking based local search solver for non-random satisfiability. In: Heule, M., Weaver, S. (eds.) Theory and Applications of Satisfiability Testing - SAT 2015, pp. 1\u20138. Springer International Publishing, Cham (2015)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1613\/jair.1.13666","volume":"74","author":"S Cai","year":"2022","unstructured":"Cai, S., Zhang, X., Fleury, M., Biere, A.: Better Decision Heuristics in CDCL through Local Search and Target Phases. Journal of Artificial Intelligence Research 74, 1515\u20131563 (2022)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"27_CR9","unstructured":"Codel, C.R., Heule, M.J.: A Study of Divide and Distribute Fixed Weights and its Variants. In: Pragmatics of SAT 2021 (2021)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Feng, N., Bacchus, F.: Clause size reduction with all-UIP learning. In: Pulina, L., Seidl, M. (eds.) Proceedings of SAT-2020. pp. 28\u201345 (2020)","DOI":"10.1007\/978-3-030-51825-7_3"},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Green, B.: New lower bounds for van der Waerden numbers (2021). https:\/\/doi.org\/10.48550\/ARXIV.2102.01543","DOI":"10.48550\/ARXIV.2102.01543"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ganai, M.K., Wang, C.: SAT-based verification methods and applications in hardware verification. In: Proceedings of SFM 2006. pp. 108\u2013143 (2006)","DOI":"10.1007\/11757283_5"},{"key":"27_CR13","unstructured":"Heule, M.J.H., Karahalios, A., van Hoeve, W.: From cliques to colorings and back again. In: Proceedings of CP-2022. pp. 26:1\u201326:10 (2022)"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.jsc.2020.10.003","volume":"104","author":"MJH Heule","year":"2019","unstructured":"Heule, M.J.H., Kauers, M., Seidl, M.: New ways to multiply 3x3-matrices. J. Symb. Comput. 104, 899\u2013916 (2019)","journal-title":"J. Symb. Comput."},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Hutter, F., Tompkins, D.A.D., Hoos, H.H.: Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In: Hentenryck, P.V. (ed.) Proceedings of CP 2002. pp. 233\u2013248 (2002)","DOI":"10.1007\/3-540-46135-3_16"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Ishtaiwi, A., Thornton, J., Sattar, A., Pham, D.N.: Neighbourhood clause weight redistribution in local search for SAT. In: Proceedings of CP-2005. pp. 772\u2013776. Lecture Notes in Computer Science (2005)","DOI":"10.1007\/11564751_62"},{"key":"27_CR17","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11\u201313, 1993","author":"DJ Johnson","year":"1996","unstructured":"Johnson, D.J., Trick, M.A.: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11\u201313, 1993. American Mathematical Society, USA (1996)"},{"key":"27_CR18","unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Proceedings of the 10th European Conference on Artificial Intelligence. p. 359\u2013363. ECAI \u201992, John Wiley & Sons Inc, USA (1992)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Li, C.M., Li, Y.: Satisfying versus falsifying in local search for satisfiability. In: Cimatti, A., Sebastiani, R. (eds.) Theory and Applications of Satisfiability Testing \u2013 SAT 2012. pp. 477\u2013478. Springer Berlin Heidelberg, Berlin, Heidelberg (2012)","DOI":"10.1007\/978-3-642-31612-8_43"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of DAC 2001. pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"issue":"2","key":"27_CR21","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.orl.2011.02.001","volume":"39","author":"J Ostrowski","year":"2011","unstructured":"Ostrowski, J., Linderoth, J., Rossi, F., Smriglio, S.: Solving large steiner triple covering problems. Operations Research Letters 39(2), 127\u2013131 (2011)","journal-title":"Operations Research Letters"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Schreiber, D., Sanders, P.: Scalable SAT solving in the cloud. In: Li, C.M., Many\u00e0, F. (eds.) Theory and Applications of Satisfiability Testing \u2013 SAT 2021. pp. 518\u2013534. Springer International Publishing, Cham (2021)","DOI":"10.1007\/978-3-030-80223-3_35"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Local search strategies for satisfiability testing. In: Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop 1993. pp. 521\u2013532 (1993)","DOI":"10.1090\/dimacs\/026\/25"},{"key":"27_CR24","unstructured":"Selman, B., Levesque, H.J., Mitchell, D.G.: A new method for solving hard satisfiability problems. In: Proceedings of AAAI 1992. pp. 440\u2013446 (1992)"},{"issue":"5","key":"27_CR25","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JPM Silva","year":"1999","unstructured":"Silva, J.P.M., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Trans. Computers 48(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Computers"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Soos, M., Nohl, K., Castelluccia, C.: Extending SAT solvers to cryptographic problems. In: Proceedings of SAT 2009. pp. 244\u2013257 (2009)","DOI":"10.1007\/978-3-642-02777-2_24"},{"key":"27_CR27","unstructured":"Thornton, J., Pham, D.N., Bain, S., Jr., V.F.: Additive versus multiplicative clause weighting for SAT. In: McGuinness, D.L., Ferguson, G. (eds.) Proceedings of AAAI-2004. pp. 191\u2013196 (2004)"},{"key":"27_CR28","unstructured":"Tompkins, D.: Dynamic Local Search for SAT: Design, Insights and Analysis. Ph.D. thesis, The University of British Columbia (2010)"},{"key":"27_CR29","unstructured":"Tompkins, D.: UBCSAT. http:\/\/ubcsat.dtompkins.com\/home (2010)"},{"key":"27_CR30","first-page":"212","volume":"15","author":"BL van der Waerden","year":"1927","unstructured":"van der Waerden, B.L.: Beweis einer baudet\u2019schen vermutung. J. Symb. Comput. 15, 212\u2013216 (1927)","journal-title":"J. Symb. Comput."},{"key":"27_CR31","unstructured":"Xindi Zhang, Shaowei Cai, Z.C.: Improving CDCL via Local Search. In: SAT Competition-2021. pp. 42\u201343 (2021)"}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:59:54Z","timestamp":1685710794000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_27","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)"}}]}}