{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:27:08Z","timestamp":1725470828956},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462675"},{"type":"electronic","value":"9783540462682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11889205_18","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T12:07:42Z","timestamp":1159445262000},"page":"229-243","source":"Crossref","is-referenced-by-count":3,"title":["Adaptive Clause Weight Redistribution"],"prefix":"10.1007","author":[{"given":"Abdelraouf","family":"Ishtaiwi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Thornton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Anbulagan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duc Nghia","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Morris, P.: The Breakout method for escaping from local minima. In: Proceedings of 11th AAAI, pp. 40\u201345 (1993)"},{"key":"18_CR2","unstructured":"Cha, B., Iwama, K.: Adding new clauses for faster local search. In: Proceedings of 13th AAAI, pp. 332\u2013337 (1996)"},{"key":"18_CR3","unstructured":"Frank, J.: Learning short-term clause weights for GSAT. In: Proceedings of 15th IJCAI, pp. 384\u2013389 (1997)"},{"key":"18_CR4","unstructured":"McAllester, D., Selman, B., Kautz, H.: Evidence for invariants in local search. In: Proceedings of 14th AAAI, pp. 321\u2013326 (1997)"},{"key":"18_CR5","unstructured":"Wu, Z., Wah, B.: An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems. In: Proceedings of 17th AAAI, pp. 310\u2013315 (2000)"},{"key":"18_CR6","unstructured":"Schuurmans, D., Southey, F.: Local search characteristics of incomplete SAT procedures. In: Proceedings of 10th AAAI, pp. 297\u2013302 (2000)"},{"key":"18_CR7","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":"18_CR8","unstructured":"Thornton, J., Pham, D.N., Bain, S., Ferreira Jr., V.: Additive versus multiplicative clause weighting for SAT. In: Proceedings of 19th AAAI, pp. 191\u2013196 (2004)"},{"key":"18_CR9","unstructured":"Hoos, H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of 19th AAAI, pp. 655\u2013660 (2002)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1007\/11564751_62","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"A. Ishtaiwi","year":"2005","unstructured":"Ishtaiwi, A., Thornton, J., Sattar, A., Pham, D.N.: Neighbourhood clause weight redistribution in local search for SAT. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 772\u2013776. Springer, Heidelberg (2005)"},{"key":"18_CR11","unstructured":"Schuurmans, D., Southey, F., Holte, R.: The exponentiated subgradient algorithm for heuristic boolean programming. In: Proceedings of 17th IJCAI, pp. 334\u2013341 (2001)"},{"key":"18_CR12","unstructured":"Anbulagan, Pham, D., Slaney, J., Sattar, A.: Old resolution meets modern SLS. In: Proceedings of 20th AAAI, pp. 354\u2013359 (2005)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Li, C.M., Huang, W.: Diversification and determinism in local search for satisfiability. In: Proceedings of 8th SAT, pp. 158\u2013172 (2005)","DOI":"10.1007\/11499107_12"},{"key":"18_CR14","unstructured":"Mills, P., Tsang, E.: Guided local search applied to the satisfiability (SAT) problem. In: Proceedings of 15th ASOR, pp. 872\u2013883 (1999)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Thornton, J.: Clause weighting local search for SAT. Journal of Automated Reasoning (to appear, 2006)","DOI":"10.1007\/s10817-005-9010-1"},{"key":"18_CR16","unstructured":"Hutter, F., Hamadi, Y.: Parameter adjustment based on performance prediction: Towards an instance aware problem solver. Technical Report: MSR-TR-2005-125, Microsoft Research, WA (2005)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BFb0017450","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"C.M. Li","year":"1997","unstructured":"Li, C.M., Anbulagan: Look-ahead versus look-back for satisfiability problems. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 341\u2013355. Springer, Heidelberg (1997)"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"627","DOI":"10.2307\/2307285","volume":"62","author":"W.V. Quine","year":"1955","unstructured":"Quine, W.V.: A way to simplify truth functions. American Mathematical Monthly\u00a062, 627\u2013631 (1955)","journal-title":"American Mathematical Monthly"},{"key":"18_CR19","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"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. Journal of the ACM\u00a012, 23\u201341 (1965)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11889205_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:30:33Z","timestamp":1619508633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11889205_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462675","9783540462682"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11889205_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}