{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:55:46Z","timestamp":1725544546175},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540367130"},{"type":"electronic","value":"9783540368618"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11803089_22","type":"book-chapter","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T04:29:24Z","timestamp":1153715364000},"page":"185-193","source":"Crossref","is-referenced-by-count":3,"title":["An Evolutionary Local Search Algorithm for the Satisfiability Problem"],"prefix":"10.1007","author":[{"given":"Levent","family":"Aksoy","sequence":"first","affiliation":[]},{"given":"Ece Olcay","family":"Gunes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"Proceedings of Third Annual ACM Symposium on Theory of Computing","author":"S. Cook","year":"1971","unstructured":"Cook, S.: The Complexity of Theorem-Proving Procedures. In: Proceedings of Third Annual ACM Symposium on Theory of Computing, pp. 151\u2013158. ACM, New York (1971)"},{"key":"22_CR2","volume-title":"Logic Minimization Algorithms for VLSI Minimization","author":"K.R. Brayton","year":"1985","unstructured":"Brayton, K.R., Sangiovanni-Vincentelli, L.A., McMullen, T.C., Hachtel, D.G.: Logic Minimization Algorithms for VLSI Minimization. Kluwer, Boston (1985)"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/43.108614","volume":"11","author":"T. Larrabee","year":"1992","unstructured":"Larrabee, T.: Efficient Generation of Test Patterns Using Boolean Satisfiability. IEEE Transactions on Computer-Aided Design\u00a011(1), 4\u201315 (1992)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of ACM\u00a07, 201\u2013215 (1960)","journal-title":"Journal of ACM"},{"issue":"5","key":"22_CR5","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Transactions on Computers\u00a048(5), 506\u2013521 (1999)","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR6","first-page":"440","volume-title":"Proceedings of Tenth National Conference on Artificial Intelligence","author":"B. Selman","year":"1992","unstructured":"Selman, B., Levesque, H., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. In: Proceedings of Tenth National Conference on Artificial Intelligence, pp. 440\u2013446. AAAI Press, California (1992)"},{"key":"22_CR7","first-page":"337","volume-title":"Proceedings of Twelfth National Conference on Artificial Intelligence","author":"B. Selman","year":"1994","unstructured":"Selman, B., Kautz, H., Cohen, B.: Noise Strategies for Improving Local Search. In: Proceedings of Twelfth National Conference on Artificial Intelligence, pp. 337\u2013343. AAAI Press, California (1994)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Spears, W.M.: Simulated Annealing for Hard Satisfiability Problems. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026, pp. 533\u2013558 (1996)","DOI":"10.1090\/dimacs\/026\/26"},{"key":"22_CR9","unstructured":"Mazure, B., Sais, L., Gregoire, E.: Tabu search for SAT. In: Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference, pp. 281\u2013285 (1997)"},{"key":"22_CR10","first-page":"393","volume-title":"Proceedings of Genetic and Evolutionary Conference","author":"E. Marchiori","year":"1999","unstructured":"Marchiori, E., Rossi, C.: A Flipping Genetic Algorithm for Hard 3-SAT Problems. In: Proceedings of Genetic and Evolutionary Conference, pp. 393\u2013400. Morgan Kaufmann, California (1999)"},{"key":"22_CR11","first-page":"463","volume-title":"Proceedings of ACM Symposium on Applied Computing","author":"C. Rossi","year":"2000","unstructured":"Rossi, C., Marchiori, E., Kok, J.: An Adaptive Evolutionary Algorithm for the Satisfiability Problem. In: Proceedings of ACM Symposium on Applied Computing, pp. 463\u2013469. ACM, New York (2000)"},{"issue":"1","key":"22_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1162\/106365602317301763","volume":"10","author":"J. Gottlieb","year":"2002","unstructured":"Gottlieb, J., Marchiori, E., Rossi, C.: Evolutionary Algorithms for the Satisfiability Problem. Evolutionary Computation\u00a010(1), 35\u201350 (2002)","journal-title":"Evolutionary Computation"},{"key":"22_CR13","unstructured":"Aksoy, L., Tekin, O.A.: Hybridization of Local Search Algorithms with a Simple Genetic Algorithm for the Satisfiability Problem. In: Proceedings of International Symposium on Innovations in Intelligent Systems and Applications, pp. 235\u2013238 (2005)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Hampson, S., Kibler, D.: Large Plateaus and Plateau Search in Boolean Satisfiability Problems: When to Give Up Searching and Start Again. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026, pp. 437\u2013455 (1996)","DOI":"10.1090\/dimacs\/026\/21"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Neural Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11803089_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T02:40:49Z","timestamp":1555728049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11803089_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540367130","9783540368618"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11803089_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}