{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:13:11Z","timestamp":1757614391477,"version":"3.44.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031982071"},{"type":"electronic","value":"9783031982088"}],"license":[{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T00:00:00Z","timestamp":1752019200000},"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":[[2026]]},"DOI":"10.1007\/978-3-031-98208-8_10","type":"book-chapter","created":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T17:57:12Z","timestamp":1752429432000},"page":"161-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SNRWLS: Improve (W)PMS Solver with\u00a0Weighting Strategies Related to\u00a0Number of\u00a0Soft Clauses"],"prefix":"10.1007","author":[{"given":"Shuhao","family":"Chen","sequence":"first","affiliation":[]},{"given":"Menghua","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Yin","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,9]]},"reference":[{"issue":"11","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1109\/TCAD.2010.2061270","volume":"29","author":"Y Chen","year":"2010","unstructured":"Chen, Y., Safarpour, S., Marques-Silva, J., Veneris, A.: Automated design debugging with maximum satisfiability. IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst. 29(11), 1804\u20131817 (2010)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Ciampiconi, L., Ghosh, B., Scarlett, J., Meel, K.S.: A MaxSAT-based framework for group testing. In: Proceedings of the AAAI Conference on Artificial Intelligence, New York, pp. 10144\u201310152 (2020)","DOI":"10.1609\/aaai.v34i06.6574"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Muise, C., McIlraith, S.A., Beck, J.C.: Optimization of partial-order plans via MaxSAT. In: ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS, Freiburg (2011)","DOI":"10.1609\/icaps.v22i1.13537"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2010.01.035","volume":"205","author":"Z Naji-Azimi","year":"2010","unstructured":"Naji-Azimi, Z., Toth, P., Galli, L.: An electromagnetism metaheuristic for the unicost set covering problem. Eur. J. Oper. Res. 205(2), 290\u2013300 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103397","volume":"289","author":"MS Cherif","year":"2020","unstructured":"Cherif, M.S., Habet, D., Abram\u00e9, A.: Understanding the power of Max-SAT resolution through UP-resilience. Artif. Intell. 289, 103397 (2020)","journal-title":"Artif. Intell."},{"key":"10_CR6","unstructured":"Li, C.-M., 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, vol. 210, pp. 38:1-38:18 (2021)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11814948_25","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"Z Fu","year":"2006","unstructured":"Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 252\u2013265. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_25"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.artint.2013.01.002","volume":"196","author":"C Ans\u00f3tegui","year":"2013","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: SAT-based MaxSAT algorithms. Artif. Intell. 196, 77\u2013105 (2013)","journal-title":"Artif. Intell."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Nadel, A.: Anytime weighted MaxSAT with improved polarity selection and bit-vector optimization. In: Proceedings of the 2019 Formal Methods in Computer Aided Design, San Jose, California, pp. 193\u2013202 (2019)","DOI":"10.23919\/FMCAD.2019.8894273"},{"key":"10_CR10","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, California, pp. 440\u2013446 (1992)"},{"key":"10_CR11","unstructured":"Cha, B., Iwama, K., Kambayashi, Y., Miyazaki, S.: Local search algorithms for partial MAXSAT. In: Proceedings of AAAI, Rhode Island, pp. 263\u2013268 (1997)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Thornton, J., Bain, S., Sattar, A., Pham, D.N.: A two level local search for MAX-SAT problems with hard and soft constraints. In: Proceedings of Artificial Intelligence 2002, Heidelberg, pp. 603\u2013614 (2002)","DOI":"10.1007\/3-540-36187-1_53"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BFb0095285","volume-title":"PRICAI\u201998: Topics in Artificial Intelligence","author":"J Thornton","year":"1998","unstructured":"Thornton, J., Sattar, A.: Dynamic constraint weighting for over-constrained problems. In: Lee, H.-Y., Motoda, H. (eds.) PRICAI 1998. LNCS, vol. 1531, pp. 377\u2013388. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0095285"},{"key":"10_CR14","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, Melbourne, pp. 571\u2013577 (2017)","DOI":"10.24963\/ijcai.2017\/80"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Lei, Z., Cai, S.: Solving (weighted) partial MaxSAT by dynamic local search for SAT. In: IJCAI, Stockholm, vol. 7, pp. 1346\u20131352 (2018)","DOI":"10.24963\/ijcai.2018\/187"},{"key":"10_CR16","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."},{"issue":"1\u20132","key":"10_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000068","volume":"12","author":"A Slivkins","year":"2019","unstructured":"Slivkins, A.: Introduction to multiarmed bandits. Found. Trends Mach. Learn. 12(1\u20132), 1\u2013286 (2019)","journal-title":"Found. Trends Mach. Learn."},{"key":"10_CR18","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. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, Vienna, pp. 1901\u20131907 (2022)","DOI":"10.24963\/ijcai.2022\/264"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Chu, Y., Cai, S., Luo, C.: NuWLS: improving local search for (weighted) partial MaxSAT by new weighting techniques. In: The Thirty-Seventh AAAI Conference on Artificial Intelligence, Washington, DC, pp. 3915\u20133923 (2023)","DOI":"10.1609\/aaai.v37i4.25505"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-98208-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T07:38:13Z","timestamp":1757057893000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98208-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,9]]},"ISBN":["9783031982071","9783031982088"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98208-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,7,9]]},"assertion":[{"value":"9 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Theoretical Aspects of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2025","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":"tase2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cyprusconferences.org\/tase2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}