{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:58:20Z","timestamp":1725533900082},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_25","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T02:58:18Z","timestamp":1245985098000},"page":"258-264","source":"Crossref","is-referenced-by-count":6,"title":["Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability"],"prefix":"10.1007","author":[{"given":"Anton","family":"Belov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zbigniew","family":"Stachniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"25_CR1","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem-Proving. Communications of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Ginsberg, M.L., McAllester, D.A.: GSAT and Dynamic Backtracking In. In: Proc. of KR 1994, pp. 226\u2013237 (1994)","DOI":"10.1016\/B978-1-4832-1452-8.50117-2"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/11527695_10","volume-title":"Theory and Applications of Satisfiability Testing","author":"\u00c9. Gr\u00e9goire","year":"2005","unstructured":"Gr\u00e9goire, \u00c9., Ostrowski, R., Mazure, B., Sa\u00efs, L.: Automatic extraction of functional dependencies. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 122\u2013132. Springer, Heidelberg (2005)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Hirsch, E.A., Kojevnikov, A.: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. In: Annals of Mathematics and Artificial Intelligence, pp. 91\u2013111 (2005)","DOI":"10.1007\/s10472-005-0421-9"},{"key":"25_CR5","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":"25_CR6","doi-asserted-by":"crossref","unstructured":"Hoos, H.H., Stutzle, T.: Local Search Algorithms for SAT: An Empirical Evaluation. J. of Automated Reasoning, 421\u2013481 (2000)","DOI":"10.1023\/A:1006350622830"},{"key":"25_CR7","unstructured":"Hoos, H.H.: An adaptive noise mechanism for walkSAT. In: Proc. of AAAI 2002, pp. 655\u2013660 (2002)"},{"key":"25_CR8","unstructured":"Jussien, N., Lhomme, O.: Local Search with Constraint Propagation and Conflict-Based Heuristics. In: Proc. of AAAI 2000, pp. 169\u2013174 (2000)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Lynce, I., Marques-Silva, J.P.: An Overview of Backtrack Search Satisfiability Algorithms. In: Annals of Mathematics and Artificial Intelligence, pp. 307\u2013326 (2003)","DOI":"10.1023\/A:1021264516079"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Richards, E.T., Richards, B.: Nonsystematic Search and No-Good Learning. In: Journal of Automated Reasoning, pp. 483\u2013533 (2000)","DOI":"10.1023\/A:1006362926464"},{"key":"25_CR11","unstructured":"Selman, B., Kautz, H., Cohen, B.: Noise Strategies for Local Search. In: Proc. of AAAI 1994, pp. 337\u2013343 (1994)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-79719-7_24","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"Z. Stachniak","year":"2008","unstructured":"Stachniak, Z., Belov, A.: Speeding-up Non-Clausal Local Search for Propositional Satisfiability with Clause Learning. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 257\u2013270. Springer, Heidelberg (2008)"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/11527695_24","volume-title":"Theory and Applications of Satisfiability Testing","author":"D.A.D. Tompkins","year":"2005","unstructured":"Tompkins, D.A.D., Hoos, H.: UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 306\u2013320. Springer, Heidelberg (2005)"},{"key":"25_CR14","unstructured":"Yokoo, M.: Weak-commitment Search for Solving Constraint Satisfaction Problems. In: Proc. of AAAI 1994, pp. 313\u2013318 (1994)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T22:57:56Z","timestamp":1558393076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}