{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:03:35Z","timestamp":1777125815240,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540262763","type":"print"},{"value":"9783540316794","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11499107_12","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T21:56:25Z","timestamp":1279144585000},"page":"158-172","source":"Crossref","is-referenced-by-count":59,"title":["Diversification and Determinism in Local Search for Satisfiability"],"prefix":"10.1007","author":[{"given":"Chu Min","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen Qi","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of 3rd Annual ACM Symp. Theory of Computing, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/11527695_24","volume-title":"Theory and Applications of Satisfiability Testing","author":"A. Fukunaga","year":"2005","unstructured":"Fukunaga, A.: Efficient implementation of sat local search. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 306\u2013320. Springer, Heidelberg (2005)"},{"key":"12_CR3","unstructured":"Gent, I., Walsh, T.: Towards an understanding of hill-climbing procedures for SAT. In: Proceedings of AAAI 1993 (1993)"},{"issue":"1-4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10472-004-9421-4","volume":"43","author":"E.A. Hirsch","year":"2005","unstructured":"Hirsch, E.A., Kojevnikov, A.: Unitwalk: A new sat solver that uses local search guided by unit clause elimination. Annals of Mathematics and Artificial Intelligence\u00a043(1-4), 91\u2013111 (2005)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"12_CR5","unstructured":"Hoos, H.: On the run-time behavior of stochastic local search algorithms for sat. In: Proceedings of AAAI 1999, pp. 661\u2013666 (1999)"},{"key":"12_CR6","unstructured":"Hoos, H.: An adaptive noise mechanism for walksat. In: Proceedings of AAAI 2002, pp. 655\u2013660. AAAI Press\/The MIT Press (2002)"},{"issue":"2","key":"12_CR7","first-page":"179","volume":"27","author":"W.Q. Huang","year":"1997","unstructured":"Huang, W.Q., Chao, J.R.: Solar: a learning from human algorithm for solving sat. Science in China (Series E)\u00a027(2), 179\u2013186 (1997)","journal-title":"Science in China (Series E)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/BFb0017450","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"C.M. Li","year":"1997","unstructured":"Li, C.M., Anbulagan, A.: Look-Ahead Versus Look-Back for Satisfiability Problems. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 342\u2013356. Springer, Heidelberg (1997)"},{"key":"12_CR9","unstructured":"Mazure, B., Sa\u00efs, L., Gr\u00e9goire, \u00c9.: Tabu Search for SAT. In: Proceedings of AAAI 1997 (1997)"},{"key":"12_CR10","unstructured":"McAllester, D.A., Selman, B., Kautz, H.: Evidence for invariant in local search. In: Proceedings of AAAI 1997, pp. 321\u2013326 (1997)"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0004-3702(01)00151-5","volume":"132","author":"D. Schuurmans","year":"2001","unstructured":"Schuurmans, D., Southey, F.: Local search characteristics of incomplete sat procedures. Artificial Intelligence\u00a0132(2), 121\u2013150 (2001)","journal-title":"Artificial Intelligence"},{"key":"12_CR12","unstructured":"Selman, B., Kautz, H.: Domain-independent extensions to gsat: Solving large structured satisfiability problems. In: Proceedings of IJCAI 1993 (1993)"},{"key":"12_CR13","first-page":"337","volume-title":"Proceedings of AAAI 1994, 12th National Conference on Artificial Intelligence","author":"B. Selman","year":"1994","unstructured":"Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of AAAI 1994, 12th National Conference on Artificial Intelligence, pp. 337\u2013343. AAAI Press, Seattle (1994)"},{"key":"12_CR14","unstructured":"Selman, B., Mitchell, D., Levesque, H.: A new Method for Solving Hard Satisfiability Problems. In: Proceedings of AAAI 1992, pp. 440\u2013446 (1992)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11499107_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:41:15Z","timestamp":1619505675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11499107_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262763","9783540316794"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11499107_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}