{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:01:59Z","timestamp":1777125719615,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540797180","type":"print"},{"value":"9783540797197","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79719-7_4","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T08:04:57Z","timestamp":1210061097000},"page":"28-33","source":"Crossref","is-referenced-by-count":48,"title":["Adaptive Restart Strategies for Conflict Driven SAT Solvers"],"prefix":"10.1007","author":[{"given":"Armin","family":"Biere","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Biere, A.: PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation (submitted, 2008)","DOI":"10.3233\/SAT190039"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, Springer, Heidelberg (2005)"},{"key":"4_CR3","unstructured":"Gomes, C., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proc.\u00a0AAAI 1998 (1998)"},{"key":"4_CR4","unstructured":"Hoos, H.: An adaptive noise mechanism for WalkSAT. In: Proc.\u00a0AAAI 2002 (2002)"},{"key":"4_CR5","unstructured":"Huang, J.: The effect of restarts on the eff.\u00a0of clause learning. In: Proc.\u00a0IJCAI 2007 (2007)"},{"key":"4_CR6","unstructured":"Kautz, H., Horvitz, E., Ruan, Y., Selman, B., Gomes, C.: Dynamic restart policies. In: Proc.\u00a0AAAI 2002 (2002)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Information Processing Letters\u00a047 (1993)","DOI":"10.1016\/0020-0190(93)90029-9"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc.\u00a0DAC 2001 (2001)","DOI":"10.1145\/378239.379017"},{"key":"4_CR9","unstructured":"Pipatsrisawat, K., Darwiche, A.: RSat 2.0: SAT solver description. Technical Report D\u2013153, Automated Reasoning Group, Comp.\u00a0Science Dept., UCLA (2007)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79719-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:20:09Z","timestamp":1606184409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79719-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797180","9783540797197"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79719-7_4","relation":{},"subject":[]}}