{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T11:39:23Z","timestamp":1790509163017,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540304623","type":"print"},{"value":"9783540316527","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11589990_10","type":"book-chapter","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T06:28:03Z","timestamp":1132986483000},"page":"70-81","source":"Crossref","is-referenced-by-count":1,"title":["Tie Breaking in Clause Weighting Local Search for SAT"],"prefix":"10.1007","author":[{"suffix":"Jr.","given":"Valnir","family":"Ferreira","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Thornton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"40","volume-title":"Proceedings of the 11th National Conference on Artificial Intelligence (AAAI 1993)","author":"P. Morris","year":"1993","unstructured":"Morris, P.: The breakout method for escaping from local minima. In: Proceedings of the 11th National Conference on Artificial Intelligence (AAAI 1993), pp. 40\u201345. MIT Press, Washington (1993)"},{"key":"10_CR2","first-page":"290","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 1993)","author":"B. Selman","year":"1993","unstructured":"Selman, B., Kautz, H.: Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 1993), Chambery, France, pp. 290\u2013295. Morgan Kaufmann, San Francisco (1993)"},{"key":"10_CR3","first-page":"378","volume-title":"Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997)","author":"B. Wah","year":"1997","unstructured":"Wah, B., Shang, Y.: Discrete lagrangian-based search for solving MAX-SAT problems. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), Nagoya, Japan, pp. 378\u2013383. Morgan Kaufmann, San Francisco (1997)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-46135-3_16","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"F. Hutter","year":"2002","unstructured":"Hutter, F., Tompkins, D., Hoos, H.: Scaling and probabilistic smoothing: Efficient dynamic local search for SAT. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 233\u2013248. Springer, Heidelberg (2002)"},{"key":"10_CR5","first-page":"191","volume-title":"Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2004)","author":"J. Thornton","year":"2004","unstructured":"Thornton, J., Pham, D.N., Bain, S., Ferreira Jr., V.: Additive versus multiplicative clause weighting for SAT. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2004), San Jose, California, pp. 191\u2013196. MIT Press, Cambridge (2004)"},{"key":"10_CR6","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, San Francisco (2005)"},{"key":"10_CR7","first-page":"297","volume-title":"Proceedings of the 1tth National Conference on Artificial Intelligence (AAAI 2000)","author":"D. Schuurmans","year":"2000","unstructured":"Schuurmans, D., Southey, F.: Local search characteristics of incomplete SAT procedures. In: Proceedings of the 1tth National Conference on Artificial Intelligence (AAAI 2000), Austin, TX, pp. 297\u2013302. MIT Press, Cambridge (2000)"},{"key":"10_CR8","first-page":"337","volume-title":"Proceedings of the 12th National Conference on Artificial Intelligence (AAAI 1994)","author":"B. Selmann","year":"1994","unstructured":"Selmann, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI 1994), Seattle, WA, pp. 337\u2013343. AAAI Press, Menlo Park (1994)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-24605-3_9","volume-title":"Theory and Applications of Satisfiability Testing","author":"S. Prestwich","year":"2004","unstructured":"Prestwich, S.: Local search on sat-encoded CSPs. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 105\u2013119. Springer, Heidelberg (2004)"},{"key":"10_CR10","first-page":"256","volume-title":"Proceedings of the 17th National Conference on Artificial Intelligence (AAAI 2000)","author":"D. Achlioptas","year":"2000","unstructured":"Achlioptas, D., Gomes, C., Kautz, H., Selman, B.: Generating satisfiable problem instances. In: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI 2000), Austin, TX, pp. 256\u2013261. MIT Press, Cambridge (2000)"},{"key":"10_CR11","first-page":"351","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2001)","author":"H. Kautz","year":"2001","unstructured":"Kautz, H., Ruan, Y., Achlioptas, D., Gomes, C., Selman, B., Stickel, M.: Balance and filtering in structured satisfiable problems. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2001), Seattle, pp. 351\u2013358. Morgan Kaufmann, San Francisco (2001)"},{"key":"10_CR12","unstructured":"Thornton, J.: Clause weighting local search for SAT. Journal of Artificial Intelligence Research (to appear)"},{"key":"10_CR13","unstructured":"Tompkins, D., Hoos, H.: Warped landscapes and random acts of SAT solving. In: Proceedings of the Eighth International Symposium on Artificial Intelligence and Mathematics - AMAI, AI&M 2004, Fort Lauderdale, Florida (2004)"}],"container-title":["Lecture Notes in Computer Science","AI 2005: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11589990_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T21:43:04Z","timestamp":1580334184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11589990_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304623","9783540316527"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11589990_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}