{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T13:12:15Z","timestamp":1783775535071,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819228546","type":"print"},{"value":"9789819228522","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T00:00:00Z","timestamp":1783814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T00:00:00Z","timestamp":1783814400000},"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":[[2027]]},"DOI":"10.1007\/978-981-92-2852-2_3","type":"book-chapter","created":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T12:29:00Z","timestamp":1783772940000},"page":"28-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["EIU-MaxSAT: Optimizing Local Search for\u00a0(Weighted) Partial MaxSAT via\u00a0Effective Information Utilization"],"prefix":"10.1007","author":[{"given":"Zhaojin","family":"Zhong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Menghua","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,12]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.artint.2017.05.003","volume":"250","author":"C Ans\u00f3tegui","year":"2017","unstructured":"Ans\u00f3tegui, C., Gab\u00e0s, J.: Wpm3: an (in) complete algorithm for weighted partial maxsat. Artif. Intell. 250, 37\u201357 (2017)","journal-title":"Artif. Intell."},{"issue":"4","key":"3_CR2","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10732-022-09495-3","volume":"28","author":"C Ans\u00f3tegui","year":"2022","unstructured":"Ans\u00f3tegui, C., Many\u00e0, F., Ojeda, J., Salvia, J.M., Torres, E.: Incomplete maxsat approaches for combinatorial testing. J. Heurist. 28(4), 377\u2013431 (2022)","journal-title":"J. Heurist."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Berg, J., Bacchus, F., Poole, A.: Abstract cores in implicit hitting set maxsat solving. In: Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT), pp. 277\u2013294 (2020)","DOI":"10.1007\/978-3-030-51825-7_20"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bonet, B., Frances, G., Geffner, H.: Learning features and abstract actions for computing generalized plans. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 2703\u20132710 (2019)","DOI":"10.1609\/aaai.v33i01.33012703"},{"key":"3_CR5","unstructured":"Cai, S.: Balance between complexity and quality: local search for minimum vertex cover in massive graphs. IJCAI, 747\u2013753 (2015)"},{"key":"3_CR6","doi-asserted-by":"publisher","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":"3_CR7","doi-asserted-by":"crossref","unstructured":"Chu, Y., Cai, S., Luo, C.: Nuwls: improving local search for (weighted) partial maxsat by new weighting techniques. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, pp. 3915\u20133923 (2023)","DOI":"10.1609\/aaai.v37i4.25505"},{"key":"3_CR8","unstructured":"Chu, Y., Li, C.M., Ye, F., Cai, S.: Enhancing maxsat local search via a unified soft clause weighting scheme. In: 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024). pp.\u00a08\u20131 (2024)"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-017-2693-y","volume":"275","author":"E Demirovi\u0107","year":"2019","unstructured":"Demirovi\u0107, E., Musliu, N., Winter, F.: Modeling and solving staff scheduling with partial weighted maxsat. Ann. Oper. Res. 275(1), 79\u201399 (2019)","journal-title":"Ann. Oper. Res."},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-981-95-0215-8_10","volume-title":"Computing and Combinatorics - COCOON 2025","author":"M Jiang","year":"2025","unstructured":"Jiang, M., Zhang, R., Chen, Y.: Improving local search for weighted partial maxsat by initializing with historical information. In: Fomin, F.V., Xiao, M. (eds.) COCOON 2025. LNCS, vol. 15983, pp. 123\u2013135. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-95-0215-8_10"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Lei, Z., Cai, S.: Solving (weighted) partial maxsat by dynamic local search for sat. IJCAI 7, 1346\u20131352 (2018)","DOI":"10.24963\/ijcai.2018\/187"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Li, C.M., Xu, Z., Coll, J., Many\u00e0, F., Habet, D., He, K.: Combining clause learning and branch and bound for maxsat (2021)","DOI":"10.24963\/ijcai.2022\/739"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Li, S., Li, C.M., Coll, J., Habet, D., Many\u00e0, F.: Improving the lower bound in branch-and-bound algorithms for maxsat. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a039, pp. 11272\u201311281 (2025)","DOI":"10.1609\/aaai.v39i11.33226"},{"key":"3_CR14","unstructured":"Zheng, J., Chen, Z., Li, C.M., He, K.: Rethinking the soft conflict pseudo Boolean constraint on maxsat local search solvers. arXiv preprint arXiv:2401.10589 (2024)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Zheng, J., He, K., Zhou, J., Jin, Y., Li, C.M., Manya, F.: Bandmaxsat: a local search maxsat solver with multi-armed bandit. IJCAI (2022)","DOI":"10.24963\/ijcai.2022\/264"},{"key":"3_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104242","volume":"338","author":"J Zheng","year":"2025","unstructured":"Zheng, J., He, K., Zhou, J., Jin, Y., Li, C.M., Many\u00e0, F.: Integrating multi-armed bandit with local search for maxsat. Artif. Intell. 338, 104242 (2025)","journal-title":"Artif. Intell."}],"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-981-92-2852-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T12:29:01Z","timestamp":1783772941000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-2852-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,12]]},"ISBN":["9789819228546","9789819228522"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-2852-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,12]]},"assertion":[{"value":"12 July 2026","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":"Beijing","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ksem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ksem2026.rosc.org.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}