{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T13:59:21Z","timestamp":1777125561210,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642215803","type":"print"},{"value":"9783642215810","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21581-0_18","type":"book-chapter","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T13:30:19Z","timestamp":1307712619000},"page":"216-229","source":"Crossref","is-referenced-by-count":8,"title":["Between Restarts and Backjumps"],"prefix":"10.1007","author":[{"given":"Antonio","family":"Ramos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"van der Tak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marijn J. H.","family":"Heule","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Biere, A.: P{re,i}coSAT@SC 2009. In: SAT 2009 competitive events booklet: preliminmary version, pp. 41\u201344 (2009)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"18_CR3","first-page":"25","volume":"1","author":"M.L. Ginsberg","year":"1993","unstructured":"Ginsberg, M.L.: Dynamic backtracking. J. Artif. Int. Res.\u00a01, 25\u201346 (1993)","journal-title":"J. Artif. Int. Res."},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0017434","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"C.P. Gomes","year":"1997","unstructured":"Gomes, C.P., Selman, B., Crato, N.: Heavy-tailed distributions in combinatorial search. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 121\u2013135. Springer, Heidelberg (1997)"},{"key":"18_CR5","unstructured":"Haim, S., Heule, M.J.H.: Towards ultra rapid restarts, Technical report, UNSW and TU Delft (2010), \n                      \n                        http:\/\/www.st.ewi.tudelft.nl\/~marijn\/publications\/rapid.pdf\n                      \n                      \n                    ,"},{"key":"18_CR6","unstructured":"Huang, J.: The Effect of Restarts on the Efficiency of Clause Learning. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp. 2318\u20132323 (2007)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of las vegas algorithms. In: ISTCS, pp. 128\u2013133 (1993)","DOI":"10.1109\/ISTCS.1993.253477"},{"key":"18_CR8","first-page":"131","volume-title":"Frontiers in Artificial Intelligence and Applications","author":"J.P. Marques-Silva","year":"2009","unstructured":"Marques-Silva, J.P., Lynce, I., Malik, S.: Conflict-Driven Clause Learning SAT Solvers. In: Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, ch.\u00a04, pp. 131\u2013153. IOS Press, Amsterdam (February 2009)"},{"issue":"5","key":"18_CR9","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J., Sakallah, K.: Grasp: a search algorithm for propositional satisfiability. IEEE Transactions on Computers\u00a048(5), 506\u2013521 (1999)","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR10","first-page":"530","volume-title":"Proceedings of the 38th annual Design Automation Conference, DAC 2001","author":"M.W. Moskewicz","year":"2001","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient sat solver. In: Proceedings of the 38th annual Design Automation Conference, DAC 2001, pp. 530\u2013535. ACM, New York (2001)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-14186-7_35","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"A. Nadel","year":"2010","unstructured":"Nadel, A., Ryvchin, V.: Assignment stack shrinking. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol.\u00a06175, pp. 375\u2013381. Springer, Heidelberg (2010)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-72788-0_28","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"K. Pipatsrisawat","year":"2007","unstructured":"Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 294\u2013299. Springer, Heidelberg (2007)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-642-04244-7_51","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"K. Pipatsrisawat","year":"2009","unstructured":"Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solvers with restarts. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 654\u2013668. Springer, Heidelberg (2009)"},{"key":"18_CR14","unstructured":"Walsh, T.: Search in a small world. In: IJCAI 1999: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 1172\u20131177 (1999)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11814948_12","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"H. Zhang","year":"2006","unstructured":"Zhang, H.: A complete random jump strategy with guiding paths. In: Biere, A., Gomes, C. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 96\u2013101. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21581-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T15:35:40Z","timestamp":1553787340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21581-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215803","9783642215810"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21581-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}