{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:27Z","timestamp":1725575247597},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540215233"},{"type":"electronic","value":"9783540246213"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24621-3_9","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T12:52:26Z","timestamp":1295009546000},"page":"103-114","source":"Crossref","is-referenced-by-count":1,"title":["Recombination Operators for Satisfiability Problems"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Lardeux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Saubion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-55602-8_172","volume-title":"Automated Deduction - CADE-11","author":"B. Benhamou","year":"1992","unstructured":"Benhamou, B., Sais, L.: Theoretical study of symmetries in propositional calculus and applications. In: Kapur, D. (ed.) CADE 1992. LNCS, vol.\u00a0607, pp. 281\u2013294. Springer, Heidelberg (1992)"},{"issue":"7","key":"9_CR2","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":"9_CR3","unstructured":"De Jong, K.A., Spears, W.M.: Using genetic algorithm to solve NP-complete problems. In: Proc. of the Third Int. Conf. on Genetic Aalgorithms, San Mateo, CA, pp. 124\u2013132 (1989)"},{"key":"9_CR4","unstructured":"Dubois, O., Dequen, G.: A backbone-search heuristic for efficient solving of hard 3-SAT formulae. In: Nebel, B. (ed.) Proc. of the IJCAI 2001, San Francisco, CA, pp. 248\u2013253 (2001)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Fleurent, C., Ferland, J.A.: Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. In: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026, pp. 619\u2013652 (1994)","DOI":"10.1090\/dimacs\/026\/29"},{"key":"9_CR6","volume-title":"Computers and Intractability , A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman & Company, San Francisco (1978)"},{"issue":"1","key":"9_CR7","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"},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P. Hansen","year":"1990","unstructured":"Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing\u00a044(4), 279\u2013303 (1990)","journal-title":"Computing"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-36605-9_24","volume-title":"Applications of Evolutionary Computing","author":"J.-K. Hao","year":"2003","unstructured":"Hao, J.-K., Lardeux, F., Saubion, F.: Evolutionary computing for the satisfiability problem. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol.\u00a02611, pp. 259\u2013268. Springer, Heidelberg (2003)"},{"key":"9_CR10","unstructured":"Hirsch, E.A., Kojevnikov, A.: UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. PDMI preprint 9\/2001, Steklov Institute of Mathematics at St. Petersburg (2001)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Jaumard, B., Stan, M., Desrosiers, J.: Tabu search and a quadratic relaxation for the satisfiability problem. In: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026, pp. 457\u2013478 (1994)","DOI":"10.1090\/dimacs\/026\/22"},{"key":"9_CR12","unstructured":"Li, C.M.: Integrating equivalency reasoning into davis-putnam procedure. In: Proc. of the AAAI 2000, pp. 291\u2013296 (2000)"},{"key":"9_CR13","unstructured":"Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: Proc. of the IJCAI 1997, pp. 366\u2013371 (1997)"},{"key":"9_CR14","unstructured":"Marchiori, E., Rossi, C.: A flipping genetic algorithm for hard 3-SAT problems. In: Proceedings of the Genetic and Evolutionary Computation Conference, vol. 1, pp. 393\u2013400 (1999)"},{"key":"9_CR15","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: Proc. of the AAAI, vol. 1, pp. 337\u2013343 (1994)"},{"key":"9_CR16","unstructured":"Selman, B., Levesque, H.J., Mitchell, D.G.: A new method for solving hard satisfiability problems. In: Proc. of the AAAI 1992, San Jose, CA, pp. 440\u2013446 (1992)"},{"key":"9_CR17","unstructured":"Simon, L., Le Berre, D., Hirsch, E.A.: The SAT 2002 competition. Technical report, Fifth International Symposium on the Theory and Applications of Satisfiability Testing (May 2002)"},{"issue":"5","key":"9_CR18","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1023\/A:1011306011437","volume":"7","author":"M. Yagiura","year":"2001","unstructured":"Yagiura, M., Ibarak, T.: Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: Experimental evaluation. Journal of Heuristics\u00a07(5), 423\u2013442 (2001)","journal-title":"Journal of Heuristics"},{"key":"9_CR19","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/3-540-63104-6_28","volume-title":"Automated Deduction - CADE-14","author":"H. Zhang","year":"1997","unstructured":"Zhang, H.: SATO: An efficient propositional prover. In: McCune, W. (ed.) CADE 1997. LNCS (LNAI), vol.\u00a01249, pp. 272\u2013275. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24621-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:34:22Z","timestamp":1558294462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24621-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540215233","9783540246213"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24621-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}