{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T15:40:10Z","timestamp":1758987610874,"version":"3.44.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T00:00:00Z","timestamp":1748044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T00:00:00Z","timestamp":1748044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Opening Project of Science and Technology on Reliability Physics and Application Technology of Electronic Component Laboratory","award":["ZHD202304"],"award-info":[{"award-number":["ZHD202304"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62074131"],"award-info":[{"award-number":["62074131"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2023A1515110941"],"award-info":[{"award-number":["2023A1515110941"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s12083-025-02021-9","type":"journal-article","created":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T01:59:08Z","timestamp":1748051948000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DPSLS: an efficient local search algorithm for pure MaxSAT"],"prefix":"10.1007","volume":"18","author":[{"given":"Huisi","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liwei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,24]]},"reference":[{"key":"2021_CR1","unstructured":"(2021) MaxSAT Evaluation 2021. https:\/\/maxsat-evaluations.github.io\/2021 Accessed: April 2021"},{"key":"2021_CR2","unstructured":"Bacchus F (2021) Maxhs in the 2021 maxsat evaluation. In: MaxSAT evaluation 2021: solver and benchmark descriptions, pp 19\u201320"},{"key":"2021_CR3","doi-asserted-by":"crossref","unstructured":"Balint A, Fr\u00f6hlich A (2010) Improving stochastic local search for sat with a new probability distribution. In: Theory and applications of satisfiability testing\u2013SAT 2010: 13th international conference, pp 10\u201315","DOI":"10.1007\/978-3-642-14186-7_3"},{"key":"2021_CR4","doi-asserted-by":"crossref","unstructured":"Balint A, Biere A, Fr\u00f6hlich A et\u00a0al (2014) Improving implementation of sls solvers for sat and new heuristics for k-sat with long clauses. In: Theory and applications of satisfiability testing\u2013SAT 2014: 17th international conference, pp 302\u2013316","DOI":"10.1007\/978-3-319-09284-3_23"},{"issue":"1","key":"2021_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s42400-019-0036-9","volume":"2","author":"M Benedetti","year":"2019","unstructured":"Benedetti M, Mori M (2019) On the use of max-sat and pddl in rbac maintenance. Cybersecurity 2(1):1\u201325","journal-title":"Cybersecurity"},{"key":"2021_CR6","first-page":"10","volume":"2020","author":"J Berg","year":"2020","unstructured":"Berg J, Demirovic E, Stuckey P (2020) Loandra in the 2020 maxsat evaluation. MaxSAT Eval 2020:10","journal-title":"MaxSAT Eval"},{"key":"2021_CR7","unstructured":"Cai S (2015) Balance between complexity and quality: Local search for minimum vertex cover in massive graphs. In: Twenty-fourth international joint conference on artificial intelligence, pp 747\u2013753"},{"key":"2021_CR8","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 (2020) Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability. Artif Intell 287:103354","journal-title":"Artif Intell"},{"key":"2021_CR9","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 (2013) Local search for boolean satisfiability with configuration checking and subscore. Artif Intell 204:75\u201398","journal-title":"Artif Intell"},{"key":"2021_CR10","doi-asserted-by":"crossref","unstructured":"Cai S, Zhang X (2020) Pure maxsat and its applications to combinatorial optimization via linear local search. In: International conference on principles and practice of constraint programming, pp 90\u2013106","DOI":"10.1007\/978-3-030-58475-7_6"},{"issue":"9\u201310","key":"2021_CR11","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai S, Su K, Sattar A (2011) Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif Intell 175(9\u201310):1672\u20131696","journal-title":"Artif Intell"},{"key":"2021_CR12","doi-asserted-by":"crossref","unstructured":"Cai S, Luo C, Thornton J et\u00a0al (2014) Tailoring local search for partial maxsat. In: Proceedings of the AAAI conference on artificial intelligence, pp 2623\u20132629","DOI":"10.1609\/aaai.v28i1.9109"},{"key":"2021_CR13","doi-asserted-by":"crossref","unstructured":"Cai S, Luo C, Su K (2015) Ccanr: a configuration checking based local search solver for non-random satisfiability. In: Theory and applications of satisfiability testing\u2013SAT 2015: 18th international conference, pp 1\u20138","DOI":"10.1007\/978-3-319-24318-4_1"},{"key":"2021_CR14","unstructured":"Cai S, Luo C, Zhang X et\u00a0al (2021) Improving local search for structured sat formulas via unit propagation based construct and cut initialization (short paper). In: 27th International conference on principles and practice of constraint programming (CP 2021), pp 1\u201310"},{"key":"2021_CR15","unstructured":"Cha B, Iwama K, Kambayashi Y et\u00a0al (1997) Local search algorithms for partial maxsat. In: AAAI, pp 263\u2013268"},{"key":"2021_CR16","doi-asserted-by":"crossref","unstructured":"Chao Z, Zhang X, Huang J et\u00a0al (2024) A fast test compaction method for commercial dft flow using dedicated pure-maxsat solver. In: 2024 29th Asia and south pacific design automation conference (ASP-DAC), pp 503\u2013508","DOI":"10.1109\/ASP-DAC58780.2024.10473833"},{"key":"2021_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2024.102265","volume":"100","author":"Z Chao","year":"2025","unstructured":"Chao Z, Zhang X, Huang J et al (2025) A fast test compaction method using dedicated pure maxsat solver embedded in dft flow. Integration 100:102265","journal-title":"Integration"},{"key":"2021_CR18","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2016.08.004","volume":"78","author":"E Demirovi\u0107","year":"2017","unstructured":"Demirovi\u0107 E, Musliu N (2017) Maxsat-based large neighborhood search for high school timetabling. Comput Oper Res 78:172\u2013180","journal-title":"Comput Oper Res"},{"key":"2021_CR19","doi-asserted-by":"publisher","first-page":"108572","DOI":"10.1016\/j.knosys.2022.108572","volume":"245","author":"H Fu","year":"2022","unstructured":"Fu H, Liu J, Wu G et al (2022) Improving probability selection based weights for satisfiability problems. Knowl-Based Syst 245:108572","journal-title":"Knowl-Based Syst"},{"key":"2021_CR20","doi-asserted-by":"crossref","unstructured":"Fulkerson D, Nemhauser G, Trotter L (2009) Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of steiner triple systems. Approach Integer Program 72\u201381","DOI":"10.1007\/BFb0120689"},{"key":"2021_CR21","doi-asserted-by":"crossref","unstructured":"Gao C, Weise T, Li J (2014) A weighting-based local search heuristic algorithm for the set covering problem. In: 2014 IEEE congress on evolutionary computation (CEC), pp 826\u2013831","DOI":"10.1109\/CEC.2014.6900355"},{"issue":"13","key":"2021_CR22","doi-asserted-by":"publisher","first-page":"134424","DOI":"10.1103\/PhysRevB.94.134424","volume":"94","author":"W Huang","year":"2016","unstructured":"Huang W, Kitchaev DA, Dacek ST et al (2016) Finding and proving the exact ground state of a generalized ising model by convex optimization and max-sat. Phys Rev B 94(13):134424","journal-title":"Phys Rev B"},{"issue":"1","key":"2021_CR23","first-page":"53","volume":"11","author":"A Ignatiev","year":"2019","unstructured":"Ignatiev A, Morgado A, Marques-Silva J (2019) Rc2: an efficient maxsat solver. J Satisfiab Bool Model Comput 11(1):53\u201364","journal-title":"J Satisfiab Bool Model Comput"},{"key":"2021_CR24","doi-asserted-by":"crossref","unstructured":"Lei Z, Cai S (2018) Solving (weighted) partial maxsat by dynamic local search for SAT. In: Proceedings of the twenty-seventh international joint conference on artificial intelligence, pp 1346\u20131352","DOI":"10.24963\/ijcai.2018\/187"},{"issue":"9","key":"2021_CR25","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1093\/comjnl\/bxz063","volume":"63","author":"Z Lei","year":"2020","unstructured":"Lei Z, Cai S (2020) Nudist: an efficient local search algorithm for (weighted) partial maxsat. Comput J 63(9):1321\u20131337","journal-title":"Comput J"},{"key":"2021_CR26","unstructured":"Lei Z, Cai S, Geng F et\u00a0al (2021a) Satlike-c: solver description. MaxSAT Eval 19\u201320"},{"key":"2021_CR27","first-page":"8","volume":"2021","author":"Z Lei","year":"2021","unstructured":"Lei Z, Cai S, Wang D et al (2021) Cashwmaxsat: solver description. MaxSAT Eval 2021:8\u20139","journal-title":"MaxSAT Eval"},{"key":"2021_CR28","unstructured":"Li CM, Xu Z, Coll J et\u00a0al (2021a) Boosting branch-and-bound maxsat solvers with clause learning. AI Commun 1\u201321"},{"key":"2021_CR29","doi-asserted-by":"crossref","unstructured":"Li CM, Xu Z, Coll J et\u00a0al (2021b) Combining clause learning and branch and bound for maxsat. In: 27th International conference on principles and practice of constraint programming (CP 2021), pp 5299\u20135303","DOI":"10.24963\/ijcai.2022\/739"},{"issue":"7","key":"2021_CR30","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1109\/TC.2014.2346196","volume":"64","author":"C Luo","year":"2014","unstructured":"Luo C, Cai S, Wu W et al (2014) Ccls: an efficient local search algorithm for weighted maximum satisfiability. IEEE Trans Comput 64(7):1830\u20131843","journal-title":"IEEE Trans Comput"},{"key":"2021_CR31","doi-asserted-by":"crossref","unstructured":"Luo C, Cai S, Su K et al (2017) Ccehc: an efficient local search algorithm for weighted partial maximum satisfiability. Artif Intell 243:26\u201344","DOI":"10.1016\/j.artint.2016.11.001"},{"key":"2021_CR32","doi-asserted-by":"crossref","unstructured":"Luo C, Hoos HH, Cai S et\u00a0al (2019) Local search with efficient automatic configuration for minimum vertex cover. In: IJCAI, pp 1297\u20131304","DOI":"10.24963\/ijcai.2019\/180"},{"issue":"5","key":"2021_CR33","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1080\/0952813X.2014.993508","volume":"27","author":"R Martins","year":"2015","unstructured":"Martins R, Manquinho V, Lynce I (2015) Improving linear search algorithms with model-based approaches for maxsat solving. J Exper Theor Artif Intell 27(5):673\u2013701","journal-title":"J Exper Theor Artif Intell"},{"issue":"11","key":"2021_CR34","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"issue":"1","key":"2021_CR35","first-page":"129","volume":"9","author":"A Morgado","year":"2014","unstructured":"Morgado A, Ignatiev A, Marques-Silva J (2014) Mscg: robust core-guided maxsat solving. J Satisfiab Bool Model Comput 9(1):129\u2013134","journal-title":"J Satisfiab Bool Model Comput"},{"key":"2021_CR36","doi-asserted-by":"crossref","unstructured":"Morgado A, Ignatiev A, Bonet ML et\u00a0al (2019) Drmaxsat with maxhs: first contact. In: Janota M, Lynce I (eds) International conference on theory and applications of satisfiability testing, pp 239\u2013249","DOI":"10.1007\/978-3-030-24258-9_17"},{"key":"2021_CR37","unstructured":"Nadel A (2021) Tt-open-wbo-inc-21: an anytime maxsat solver entering mse\u201921. MaxSAT Eval 2021"},{"issue":"7","key":"2021_CR38","doi-asserted-by":"publisher","first-page":"5347","DOI":"10.1007\/s10462-021-10024-0","volume":"54","author":"MH Newton","year":"2021","unstructured":"Newton MH, Polash M, Pham DN et al (2021) Evaluating logic gate constraints in local search for structured satisfiability problems. Artif Intell Rev 54(7):5347\u20135411","journal-title":"Artif Intell Rev"},{"key":"2021_CR39","unstructured":"Selman B, Kautz HA, Cohen B et\u00a0al (1994) Noise strategies for improving local search. In: AAAI, pp 337\u2013343"},{"key":"2021_CR40","doi-asserted-by":"crossref","unstructured":"Thornton J, Sattar A (1998) Dynamic constraint weighting for over-constrained problems. In: Pacific rim international conference on artificial intelligence, pp 377\u2013388","DOI":"10.1007\/BFb0095285"},{"key":"2021_CR41","doi-asserted-by":"crossref","unstructured":"Thornton J, Bain S, Sattar A, et\u00a0al (2002) A two level local search for max-sat problems with hard and soft constraints. In: Australian joint conference on artificial intelligence, pp 603\u2013614","DOI":"10.1007\/3-540-36187-1_53"},{"key":"2021_CR42","doi-asserted-by":"crossref","unstructured":"Wang Y, Cai S, Chen J, et\u00a0al (2018) A fast local search algorithm for minimum weight dominating set problem on massive graphs. In: IJCAI, pp 1514\u20131522","DOI":"10.24963\/ijcai.2018\/210"},{"key":"2021_CR43","doi-asserted-by":"publisher","first-page":"103230","DOI":"10.1016\/j.artint.2019.103230","volume":"280","author":"Y Wang","year":"2020","unstructured":"Wang Y, Cai S, Chen J et al (2020) Sccwalk: an efficient local search algorithm and its improvements for maximum weight clique problem. Artif Intell 280:103230","journal-title":"Artif Intell"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-025-02021-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-025-02021-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-025-02021-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,27]],"date-time":"2025-09-27T15:21:31Z","timestamp":1758986491000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-025-02021-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,24]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2021"],"URL":"https:\/\/doi.org\/10.1007\/s12083-025-02021-9","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"type":"print","value":"1936-6442"},{"type":"electronic","value":"1936-6450"}],"subject":[],"published":{"date-parts":[[2025,5,24]]},"assertion":[{"value":"30 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"188"}}