{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:45:28Z","timestamp":1743151528181,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031402883"},{"type":"electronic","value":"9783031402890"}],"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-40289-0_21","type":"book-chapter","created":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T23:02:27Z","timestamp":1691535747000},"page":"256-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heavy Weighting for\u00a0Potential Important Clauses"],"prefix":"10.1007","author":[{"given":"Hanyi","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Menghua","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,9]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1613\/jair.1.11741","volume":"66","author":"C Ans\u00f3tegui","year":"2019","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Gir\u00e1ldez-Cru, J., Levy, J., Simon, L.: Community structure in industrial SAT instances. J. Artif. Intell. Res. 66, 443\u2013472 (2019)","journal-title":"J. Artif. Intell. Res."},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-319-24318-4_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"C Ans\u00f3tegui","year":"2015","unstructured":"Ans\u00f3tegui, C., Gir\u00e1ldez-Cru, J., Levy, J., Simon, L.: Using community structure to detect relevant learnt clauses. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 238\u2013254. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_18"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"103354","DOI":"10.1016\/j.artint.2020.103354","volume":"287","author":"S Cai","year":"2020","unstructured":"Cai, S., Lei, Z.: Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability. Artif. Intell. 287, 103354 (2020)","journal-title":"Artif. Intell."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Cai, S., Luo, C., Thornton, J., Su, K.: Tailoring local search for partial maxsat. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, Qu\u00e9bec City, Canada. pp. 2623\u20132629 (2014)","DOI":"10.1609\/aaai.v28i1.9109"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Cai, S., Luo, C., Zhang, H.: From decimation to local search and back: a new approach to maxsat. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, pp. 571\u2013577 (2017)","DOI":"10.24963\/ijcai.2017\/80"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.artint.2013.09.001","volume":"204","author":"S Cai","year":"2013","unstructured":"Cai, S., Su, K.: Local search for boolean satisfiability with configuration checking and subscore. Artif. Intell. 204, 75\u201398 (2013)","journal-title":"Artif. Intell."},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10951-021-00701-x","volume":"25","author":"AD Coster","year":"2022","unstructured":"Coster, A.D., Musliu, N., Schaerf, A., Schoisswohl, J., Smith-Miles, K.: Algorithm selection and instance space analysis for curriculum-based course timetabling. J. Sched. 25(1), 35\u201358 (2022)","journal-title":"J. Sched."},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"21_CR9","unstructured":"Kilby, P., Slaney, J.K., Thi\u00e9baux, S., Walsh, T.: Backbones and backdoors in satisfiability. In: Proceedings, The 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, Pittsburgh, USA, pp. 1368\u20131373 (2005)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Lei, Z., Cai, S.: Solving (weighted) partial maxsat by dynamic local search for SAT. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, Stockholm, Sweden, pp. 1346\u20131352 (2018)","DOI":"10.24963\/ijcai.2018\/187"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Li, C.M., Many\u00e0, F.: Maxsat, hard and soft constraints. In: Handbook of Satisfiability - Second Edition, Frontiers in Artificial Intelligence and Applications, vol. 336, pp. 903\u2013927. IOS Press (2021)","DOI":"10.3233\/FAIA201007"},{"key":"21_CR12","unstructured":"Li, C., Xu, Z., Coll, J., Many\u00e0, F., Habet, D., He, K.: Combining clause learning and branch and bound for maxsat. In: Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, Montpellier, France (Virtual Conference), LIPIcs, vol. 210, pp. 38:1\u201338:18 (2021)"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-26287-1_14","volume-title":"Hardware and Software: Verification and Testing","author":"JH Liang","year":"2015","unstructured":"Liang, J.H., Ganesh, V., Zulkoski, E., Zaman, A., Czarnecki, K.: Understanding VSIDS branching heuristics in\u00a0conflict-driven clause-learning SAT solvers. In: Piterman, N. (ed.) HVC 2015. LNCS, vol. 9434, pp. 225\u2013241. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26287-1_14"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-51825-7_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2020","author":"J-H Lorenz","year":"2020","unstructured":"Lorenz, J.-H., W\u00f6rz, F.: On the effect of learned clauses on stochastic local search. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 89\u2013106. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_7"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Narodytska, N., Bacchus, F.: Maximum satisfiability using core-guided maxsat resolution. In: Proceedings of the 28th AAAI Conference on Artificial Intelligence, Qu\u00e9bec City, Canada, pp. 2717\u20132723. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.9124"},{"key":"21_CR16","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, USA, vol. 1, pp. 337\u2013343 (1994)"},{"key":"21_CR17","unstructured":"Selman, B., Levesque, H.J., Mitchell, D.G.: A new method for solving hard satisfiability problems. In: Proceedings of the 10th National Conference on Artificial Intelligence, San Jose, USA, pp. 440\u2013446 (1992)"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming \u2014 CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Silva, J.P.M., Sakallah, K.A.: Boolean satisfiability in electronic design automation. In: Proceedings of the 37th Conference on Design Automation, Los Angeles, USA, pp. 675\u2013680. ACM (2000)","DOI":"10.1145\/337292.337611"},{"issue":"1","key":"21_CR20","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/s10479-012-1124-3","volume":"196","author":"Q Wu","year":"2012","unstructured":"Wu, Q., Hao, J., Glover, F.W.: Multi-neighborhood tabu search for the maximum weight clique problem. Ann. Oper. Res. 196(1), 611\u2013634 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"12","key":"21_CR21","doi-asserted-by":"publisher","first-page":"1846","DOI":"10.3390\/e24121846","volume":"24","author":"Z Zhang","year":"2022","unstructured":"Zhang, Z., Zhou, J., Wang, X., Yang, H., Fan, Y.: Initial solution generation and diversified variable picking in local search for (weighted) partial maxsat. Entropy 24(12), 1846 (2022)","journal-title":"Entropy"},{"key":"21_CR22","unstructured":"Zheng, J., Zhou, J., He, K.: Farsighted probabilistic sampling based local search for (weighted) partial maxsat. CoRR abs\/2108.09988 (2021)"}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-40289-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T22:12:58Z","timestamp":1729894378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40289-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031402883","9783031402890"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40289-0_21","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":"9 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Science, Engineering and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","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":"ksem2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ksem2023.conferences.academy\/","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":"395","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":"114","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":"30","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":"29% - 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":"2,5","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":"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)"}}]}}