{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:09:43Z","timestamp":1742951383723,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642351006"},{"type":"electronic","value":"9783642351013"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35101-3_19","type":"book-chapter","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T16:40:16Z","timestamp":1354207216000},"page":"218-229","source":"Crossref","is-referenced-by-count":0,"title":["A Method to Avoid Duplicative Flipping in Local Search for SAT"],"prefix":"10.1007","author":[{"given":"Thach-Thao","family":"Duong","sequence":"first","affiliation":[]},{"given":"Duc Nghia","family":"Pham","sequence":"additional","affiliation":[]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-14186-7_3","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"A. Balint","year":"2010","unstructured":"Balint, A., Fr\u00f6hlich, A.: Improving Stochastic Local Search for SAT with a New Probability Distribution. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 10\u201315. Springer, Heidelberg (2010)"},{"issue":"2-4","key":"19_CR2","first-page":"75","volume":"4","author":"A. Biere","year":"2008","unstructured":"Biere, A.: Picosat essentials. JSAT\u00a04(2-4), 75\u201397 (2008)","journal-title":"JSAT"},{"key":"19_CR3","unstructured":"Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of AAAI 2002, pp. 635\u2013660 (2002)"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F. Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: Paramils: An automatic algorithm configuration framework. J. Artif. Intell. Res. (JAIR)\u00a036, 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"19_CR5","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.A.D., H. 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":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/11499107_12","volume-title":"Theory and Applications of Satisfiability Testing","author":"C.-M. Li","year":"2005","unstructured":"Li, C.-M., Huang, W.Q.: Diversification and Determinism in Local Search for Satisfiability. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 158\u2013172. Springer, Heidelberg (2005)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-72788-0_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"C.-M. Li","year":"2007","unstructured":"Li, C.-M., Wei, W., Zhang, H.: Combining Adaptive Noise and Look-Ahead in Local Search for SAT. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 121\u2013133. Springer, Heidelberg (2007)"},{"key":"19_CR8","unstructured":"McAllester, D.A., Selman, B., Kautz, H.A.: Evidence for invariants in local search. In: AAAI\/IAAI, pp. 321\u2013326 (1997)"},{"issue":"2-4","key":"19_CR9","first-page":"149","volume":"4","author":"D.N. Pham","year":"2008","unstructured":"Pham, D.N., Thornton, J., Gretton, C., Sattar, A.: Combining adaptive and dynamic local search for satisfiability. JSAT\u00a04(2-4), 149\u2013172 (2008)","journal-title":"JSAT"},{"key":"19_CR10","unstructured":"Prestwich, S.: SAT problems with chains of dependent variables. In: Discrete Applied Mathematics, vol.\u00a03037, pp. 1\u201322 (2002)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/11499107_15","volume-title":"Theory and Applications of Satisfiability Testing","author":"S.D. Prestwich","year":"2005","unstructured":"Prestwich, S.D.: Random Walk with Continuously Smoothed Variable Weights. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 203\u2013215. Springer, Heidelberg (2005)"},{"key":"19_CR12","unstructured":"Selman, B., Kautz, H.A.: Domain-independent extensions to gsat: Solving large structured satisfiability problems. In: IJCAI, pp. 290\u2013295 (1993)"},{"key":"19_CR13","unstructured":"Selman, B., Levesque, H.J., Mitchell, D.G.: A new method for solving hard satisfiability problems. In: AAAI, pp. 440\u2013446 (1992)"},{"issue":"4-5","key":"19_CR14","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"\u00c9.D. Taillard","year":"1991","unstructured":"Taillard, \u00c9.D.: Robust taboo search for the quadratic assignment problem. Parallel Computing\u00a017(4-5), 443\u2013455 (1991)","journal-title":"Parallel Computing"},{"key":"19_CR15","unstructured":"Thornton, J.R., Pham, D.N., Bain, S., Ferreira Jr., V.: Additive versus multiplicative clause weighting for SAT. In: Proceedings of AAAI 2004, pp. 191\u2013196 (2004)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-642-21581-0_24","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"D.A.D. Tompkins","year":"2011","unstructured":"Tompkins, D.A.D., Balint, A., Hoos, H.H.: Captain Jack: New Variable Selection Heuristics in Local Search for SAT. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol.\u00a06695, pp. 302\u2013316. Springer, Heidelberg (2011)"},{"key":"19_CR17","unstructured":"Wei, W., Li, C.M.: Switching between two adaptive noise mechanisms in localsearch. In: Booklet of the 2009 SAT Competition (2009)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-540-85958-1_21","volume-title":"Principles and Practice of Constraint Programming","author":"W. Wei","year":"2008","unstructured":"Wei, W., Li, C.-M., Zhang, H.: Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 313\u2013326. Springer, Heidelberg (2008)"},{"key":"19_CR19","unstructured":"Wu, Z., Wah, B.W.: Trap escaping strategies in discrete lagrangian methods for solving hard satisfiability and maximum satisfiability problems. In: AAAI\/IAAI, pp. 673\u2013678 (1999)"}],"container-title":["Lecture Notes in Computer Science","AI 2012: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35101-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T20:50:50Z","timestamp":1675284650000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-35101-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642351006","9783642351013"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35101-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}