{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:29Z","timestamp":1725512009913},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797180"},{"type":"electronic","value":"9783540797197"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79719-7_24","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T08:04:57Z","timestamp":1210061097000},"page":"257-270","source":"Crossref","is-referenced-by-count":2,"title":["Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning"],"prefix":"10.1007","author":[{"given":"Zbigniew","family":"Stachniak","sequence":"first","affiliation":[]},{"given":"Anton","family":"Belov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1613\/jair.1681","volume":"24","author":"D. Achlioptas","year":"2005","unstructured":"Achlioptas, D., Jia, H., Moore, C.: Hiding Satisfying Assignments: Two are Better than One. J. of Artificial Intelligence Research\u00a024, 623\u2013639 (2005)","journal-title":"J. of Artificial Intelligence Research"},{"key":"24_CR2","unstructured":"Crawford, J.M., Kearns, M.J., Shapire, R.E.: The Minimal Disagreement Parity Problem as Hard Satisfiability Problem. Computational Intell. Research Lab and AT&T Bell Labs TR (1994)"},{"key":"24_CR3","unstructured":"Fang, H., Ruml, W.: Complete Local Search for Propositional Satisfiability. In: AAAI, pp. 161\u2013166 (2004)"},{"key":"24_CR4","unstructured":"Hoos, H.H.: Local Search \u2013 Methods, Models, Applications. TU Dermstadt, FB Informatik, Darmstadt, Germany (1998)"},{"key":"24_CR5","unstructured":"Hoos, H.H.: On the Run-Time Behavior of Stochastic Local Search Algorithms for SAT. In: AAAI\/IAAI, pp. 661\u2013666 (1999)"},{"key":"24_CR6","unstructured":"Hoos, H.H.: An Adaptive Noise Mechanism for WalkSAT. In: AAAI, pp. 655\u2013660 (2002)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/A:1006350622830","volume":"24","author":"H.H. Hoos","year":"2000","unstructured":"Hoos, H.H., Stutzle, T.: Local Search Algorithms for SAT: An Empirical Evaluation. Journal of Automated Reasoning\u00a024, 421\u2013481 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"24_CR8","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H.H. Hoos","year":"2005","unstructured":"Hoos, H.H., Stutzle, T.: Stochastic Local Search: Foundations and Applications. Elsevier, Amsterdam (2005)"},{"key":"24_CR9","unstructured":"Kautz, H., Selman, B., McAllester, D.: Exploiting Variable Dependency in Local Search. In: IJCAI (1997)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Lynce, I., Marques-Silva, J.P.: An Overview of Backtrack Search Satisfiability Algorithms. Annals of Mathematics and Artificial Intelligence, 307\u2013326 (2003)","DOI":"10.1023\/A:1021264516079"},{"key":"24_CR11","unstructured":"McAllester, D., Selman, B., Kautz, H.: Evidence for Invariants in Local Search. In: AAAI, pp. 321\u2013326 (1997)"},{"key":"24_CR12","unstructured":"Navarro, J.A., Voronkov, A.: Generation of Hard Non-Clausal Random Satisfiability Problems. In: AAAI, pp. 436\u2013442 (2005)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-72788-0_14","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"S.D. Prestwich","year":"2007","unstructured":"Prestwich, S.D.: Variable Dependency in Local Search: Prevention Is Better Than Cure. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 107\u2013120. Springer, Heidelberg (2007)"},{"key":"24_CR14","unstructured":"Stachniak, Z.: Going Non-clausal. In: SAT, pp. 316\u2013322 (2002)"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/11527695_24","volume-title":"Theory and Applications of Satisfiability Testing","author":"D.A. Tompkins","year":"2005","unstructured":"Tompkins, D.A., Hoos, H.: UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 306\u2013320. Springer, Heidelberg (2005)"},{"key":"24_CR16","unstructured":"Velev, M.: Miroslav Velev\u2019s SAT Benchmarks, http:\/\/www.miroslav-velev.com\/sat_benchmarks.html"}],"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_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:29:14Z","timestamp":1619522954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79719-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797180","9783540797197"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79719-7_24","relation":{},"subject":[]}}