{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T11:39:19Z","timestamp":1791459559127,"version":"4.3.4"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"China National 973 Projects","award":["2010CB328103"],"award-info":[{"award-number":["2010CB328103"]}]},{"name":"China National 973 Projects","award":["2014CB340301"],"award-info":[{"award-number":["2014CB340301"]}]},{"DOI":"10.13039\/100000163","name":"ARC","doi-asserted-by":"publisher","award":["FT0991785"],"award-info":[{"award-number":["FT0991785"]}],"id":[{"id":"10.13039\/100000163","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61370072"],"award-info":[{"award-number":["61370072"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2015,7,1]]},"DOI":"10.1109\/tc.2014.2346196","type":"journal-article","created":{"date-parts":[[2014,8,8]],"date-time":"2014-08-08T14:57:58Z","timestamp":1407509878000},"page":"1830-1843","source":"Crossref","is-referenced-by-count":83,"title":["CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability"],"prefix":"10.1109","volume":"64","author":[{"given":"Chuan","family":"Luo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaowei","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhong","family":"Jie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaile","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1179","article-title":"Backbone guided local search for maximum satisfiability","author":"zhang","year":"0","journal-title":"Proc 18th Int Joint Conf Artif Intell"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.04.001"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICICT.2009.5267186"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1108\/eb026772"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0364-6408(90)90061-X","article-title":"A use statistic for collection management: The 80\/20 rule revisited","volume":"14","author":"a","year":"1990","journal-title":"Library Acquisitions: Practice & Theory"},{"key":"ref30","first-page":"10","article-title":"Balance between intensification and diversification: Two sides of the same coin","author":"li","year":"0","journal-title":"Proceedings of SAT Competition 2013 Solver and Benchmark Descriptions"},{"key":"ref37","first-page":"337","article-title":"A simple model to generate hard satisfiable instances","author":"xu","year":"0","journal-title":"Proc 19th Int Joint Conf Artif Intell"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.33"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2007.203"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.251"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.003"},{"key":"ref27","year":"0"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2012.36"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2002.1013891"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44886-1_12"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1.3.190"},{"key":"ref22","first-page":"434","article-title":"Configuration checking with aspiration in local search for SAT","author":"cai","year":"0","journal-title":"Proc 26th AAAI Conf Artif Intell"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/264216.264220"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2011.18"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.09.001"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40627-0_12"},{"key":"ref25","first-page":"15","article-title":"Improved exact solver for the weighted Max-SAT problem","author":"k\u00fcgel","year":"0","journal-title":"Pragmatics of SAT"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2011.54"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"95","DOI":"10.3233\/SAT190091","article-title":"QMaxSAT: A partial Max-SAT solver","volume":"8","author":"koshimura","year":"2012","journal-title":"J Satisfiability Boolean Model Comput"},{"key":"ref56","year":"0"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40627-0_37"},{"key":"ref54","first-page":"570","article-title":"Improving local search for random3-SAT using quantitative configuration checking","author":"luo","year":"0","journal-title":"Proc 20th Eur Conf Artif Intell"},{"key":"ref53","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/SAT190075","article-title":"The Sat4j library, release 2.2","volume":"7","author":"l","year":"2010","journal-title":"J Satisfiability Boolean Model Comput"},{"key":"ref52","year":"0"},{"key":"ref10","first-page":"13","article-title":"Improved design debugging using maximum satisfiability","author":"safarpour","year":"0","journal-title":"Proc Formal Methods in Computer-Aided Design"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1613\/jair.2215","article-title":"New inference rules for Max-SAT","volume":"30","author":"li","year":"2007","journal-title":"J Artif Intell Res"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006343127545"},{"key":"ref12","first-page":"351","article-title":"Within-problem learning for efficient lower bound computation in Max-SAT solving","author":"lin","year":"0","journal-title":"Proc 23rd AAAI Conf Artif Intell"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"ref15","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"selman","year":"0","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref16","first-page":"337","article-title":"Noise strategies for improving local search","author":"selman","year":"0","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.206"},{"key":"ref18","first-page":"544","article-title":"Integrating systematic and local search paradigms: A new strategy for MaxSAT","author":"kroc","year":"0","journal-title":"Proc 21st Int Joint Conf Artif Intell"},{"key":"ref19","author":"michiels","year":"2007","journal-title":"Theoretical Aspects of Local Search"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.811450"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/1198255.1198259","article-title":"AS relationships: Inference and validation","volume":"37","author":"a","year":"2007","journal-title":"Comput Commun Rev"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011203002719"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.1040.0189","article-title":"Optimal protein structure alignment using maximum cliques","volume":"53","author":"m","year":"2005","journal-title":"Oper Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2006.11.005"},{"key":"ref7","first-page":"682","article-title":"Using weighted MAX-SAT engines to solve MPE","author":"park","year":"0","journal-title":"Proc 18th Nat Conf Artif Intell"},{"key":"ref49","first-page":"403","article-title":"Solving (weighted) partial MaxSAT with ILP","author":"ans\u00f3tegui","year":"0","journal-title":"Proc Int Conf Integr Artif Intell Oper Res Techn Constraint Program"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2061270"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.01.002"},{"key":"ref45","first-page":"467","article-title":"Exploiting cycle structures in Max-SAT","author":"li","year":"0","journal-title":"Proc Int Conf Theory and Appl Satisfiability Testing"},{"key":"ref48","first-page":"36","article-title":"Core-guided binary search algorithms for maximum satisfiability","author":"heras","year":"0","journal-title":"Proc 25th AAAI Conf Artif Intell"},{"key":"ref47","first-page":"3","article-title":"A new algorithm for weighted partial MaxSAT","author":"ans\u00f3tegui","year":"0","journal-title":"Proc 24th AAAI Conf Artif Intell"},{"key":"ref42","year":"0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011306011437"},{"key":"ref44","first-page":"37","article-title":"UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT","author":"tompkins","year":"0","journal-title":"Proc Int Conf Theory and Appl Satisfiability Testing"},{"key":"ref43","first-page":"378","article-title":"Discrete lagrangian-based search for solving MAX-SAT problems","author":"wah","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7118804\/06874523.pdf?arnumber=6874523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:42:24Z","timestamp":1641987744000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6874523\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":56,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tc.2014.2346196","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}