{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:08:44Z","timestamp":1736140124390,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540305538"},{"type":"electronic","value":"9783540316503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11591191_41","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T09:44:25Z","timestamp":1132652665000},"page":"595-605","source":"Crossref","is-referenced-by-count":2,"title":["Another Complete Local Search Method for SAT"],"prefix":"10.1007","author":[{"given":"Haiou","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hantao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/B978-044450813-3\/50004-7","volume-title":"The Hanfbook of Automated Reasoning","author":"L. Bachmair","year":"2001","unstructured":"Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) The Hanfbook of Automated Reasoning, vol.\u00a0I, ch.2, pp. 19\u201399. Elsevier Science Pub., Amsterdam (2001)"},{"key":"41_CR2","unstructured":"Beame, P., Kautz, H., Sabharwal, A.: Understanding the power of clause learning. In: Proceedings of IJCAI 2003, pp. 1194\u20131201 (2003)"},{"key":"41_CR3","unstructured":"Cha, B., Iwama, K.: Adding new clauses for faster local search. In: Proceedings of AAAI 1996, pp. 332\u2013337 (1996)"},{"key":"41_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"issue":"7","key":"41_CR5","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Journal of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Journal of the ACM"},{"key":"41_CR6","unstructured":"Fang, H., Ruml, W.: Complete Local Search for Propositional Satisfiability. In: Proc. of 19th National Conference on Artificial Intelligence, pp. 161\u2013166 (2004)"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Boldberg, E., Novikov, Y.: BerkMin: a Fast and Robust SAT-Solver. In: Proc. of DATE 2002, pp. 142\u2013149 (2002)","DOI":"10.1109\/DATE.2002.998262"},{"key":"41_CR8","first-page":"283","volume-title":"SAT 2000","author":"H.H. Hoos","year":"2000","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB: An Online Resource for Research on SAT. In: Gent, I.P., Maaren, H.V., Walsh, T. (eds.) SAT 2000, pp. 283\u2013292. IOS Press, Amsterdam (2000) SATLIB is available online at, www.satlib.org"},{"key":"41_CR9","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H.H. Hoos","year":"2005","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45193-8_1","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"H. Kautz","year":"2003","unstructured":"Kautz, H., Selman, B.: Ten challenges redux: Recent progress in propositional reasoning and search. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 1\u201318. Springer, Heidelberg (2003)"},{"issue":"5","key":"41_CR11","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Trans. Comput.\u00a048(5), 506\u2013520 (1999)","journal-title":"IEEE Trans. Comput."},{"key":"41_CR12","unstructured":"Morris, P.: The breakout method for escaping from local minima. In: Proceedings of AAAI 1993, pp. 40\u201345 (1993)"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. of Design Automation Conference, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"41_CR14","unstructured":"Nadel, A.: Backtrack Search Algorithms for Propositional Logic Satisfiability: Review and Innovations. Thesis of Nadel, A (2002)"},{"key":"41_CR15","unstructured":"Selman, B., Kautz, H., McAllester, D.: Ten challenges in propositional reasoning and search. In: Proc. of IJCAI 1995, pp. 50\u201354 (1995)"},{"key":"41_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1008238928345","volume":"10","author":"Y. Shang","year":"1997","unstructured":"Shang, Y., Wah, B.W.: A discrete Lagrangian-based global-search method for solving satisfiability problems. Journal of Global Optimization\u00a010, 1\u201340 (1997)","journal-title":"Journal of Global Optimization"},{"key":"41_CR17","unstructured":"Wu, Z., Wah, B.W.: An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems. In: Proceedings of AAAI 2000, pp. 310\u2013315 (2000)"},{"key":"41_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/BFb0017451","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"M. Yokoo","year":"1997","unstructured":"Yokoo, M.: Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 356\u2013370. Springer, Heidelberg (1997)"},{"key":"41_CR19","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/3-540-61511-3_96","volume-title":"Automated Deduction - Cade-13","author":"H. Zhang","year":"1996","unstructured":"Zhang, H.: SATO: An efficient propositional prover. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS (LNAI), vol.\u00a01104, pp. 308\u2013312. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11591191_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T20:12:02Z","timestamp":1736107922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11591191_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540305538","9783540316503"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11591191_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}