{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:38:09Z","timestamp":1725493089781},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540009764"},{"type":"electronic","value":"9783540366058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36605-9_24","type":"book-chapter","created":{"date-parts":[[2007,10,26]],"date-time":"2007-10-26T21:03:42Z","timestamp":1193432622000},"page":"258-267","source":"Crossref","is-referenced-by-count":10,"title":["Evolutionary Computing for the Satisfiability Problem"],"prefix":"10.1007","author":[{"given":"Jin-Kao","family":"Hao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Lardeux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Saubion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,4,15]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Belaid Benhamou and Lakhdar Sais. Theoretical study of symmetries in propositional calculus and applications. In CADE\u201992, pages 281\u2013294, 1992.","DOI":"10.1007\/3-540-55602-8_172"},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"106","DOI":"10.2307\/2686263","volume":"20","author":"M. Beresin","year":"1989","unstructured":"May Beresin, Eugene Levine, and John Winn. A chessboard coloring problem. The College Mathematics Journal, 20(2):106\u2013114, 1989.","journal-title":"The College Mathematics Journal"},{"issue":"7","key":"24_CR3","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Communications of the ACM, 5(7):394\u2013397, Jul 1962.","journal-title":"Communications of the ACM"},{"key":"24_CR4","unstructured":"Kenneth A. De Jong and William M. Spears. Using genetic algorithm to solve NP-complete problems. In Proc. of the Third Int. Conf. on Genetic Algorithms, pages 124\u2013132, San Mateo, CA, 1989."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Olivier Dubois, Pascal Andr\u00e9, Yacine Boufkhad, and Jacques Carlier. SAT versus UNSAT. In Second DIMACS implementation challenge: cliques, coloring and satis fiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 415\u2013436, 1996.","DOI":"10.1090\/dimacs\/026\/20"},{"key":"24_CR6","unstructured":"Olivier Dubois and Gilles Dequen. A backbone-search heuristic for efficient solving of hard 3-SAT formulae. In Bernhard Nebel, editor, Proc. of the IJCAI\u201901, pages 248\u2013253, San Francisco, CA, 2001."},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1009638304510","volume":"4","author":"A. E. Eiben","year":"1998","unstructured":"Agoston E. Eiben, Jan K. van der Hauw, and Jano I. van Hemert. Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics, 4(1):25\u201346, 1998.","journal-title":"Journal of Heuristics"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1997","unstructured":"Charles Fleurent and Jacques A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63:437\u2013461, 1997.","journal-title":"Annals of Operations Research"},{"key":"24_CR9","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1978","unstructured":"Michael R. Garey and David S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman & Company, San Francisco, 1978."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Fred Glover and Manuel Laguna. Tabu Search. Kluwer Academic Publishers, 1998.","DOI":"10.1007\/978-1-4615-6089-0"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1162\/106365602317301763","volume":"10","author":"J. Gottlieb","year":"2002","unstructured":"Jens Gottlieb, Elena Marchiori, and Claudio Rossi. Evolutionary algorithms for the satisfiability problem. Evolutionary Computation, 10(1):35\u201350, 2002.","journal-title":"Evolutionary Computation"},{"issue":"2","key":"24_CR12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R. W. Hamming","year":"1950","unstructured":"Richard W. Hamming. Error detecting and error correcting codes. The Bell System Technical Journal, 29(2):147\u2013160, April 1950.","journal-title":"The Bell System Technical Journal"},{"key":"24_CR13","unstructured":"Jin-Kao Hao and Raphael Dorne. A new population-based method for satisfiability problems. In Proc. of the 11th European Conf. on Artificial Intelligence, pages 135\u2013139, Amsterdam, 1994."},{"key":"24_CR14","unstructured":"Edward A. Hirsch and Arist Kojevnikov. 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."},{"issue":"27","key":"24_CR15","first-page":"179","volume":"2","author":"W. Huang","year":"1997","unstructured":"Wengi Huang and Renchao Jin. Solar, a quasi physical algorithm for sat. Science in China (Series E), 2(27):179\u2013186, 1997.","journal-title":"Science in China (Series E)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Henry Kautz and Bart Selman. Workshop on theory and applications of satisfiability testing (SAT2001). In Electronic Notes in Discrete Mathematics, volume 9, June 2001.","DOI":"10.1016\/S1571-0653(04)00310-5"},{"key":"24_CR17","unstructured":"Chu Min Li. Integrating equivalency reasoning into davis-putnam procedure. In Proc. of the AAAI\u201900, pages 291\u2013296, 2000."},{"key":"24_CR18","unstructured":"Chu Min Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proc. of the IJCAI\u201997, pages 366\u2013371, 1997."},{"key":"24_CR19","unstructured":"Chu Min Li, Bernard Jurkowiak, and Paul W. Purdom. Integrating symmetry breaking into a dll procedure. In Fifth International Symposium on the Theory and Applications of Satisfiability Testing (SAT2002), pages 149\u2013155, 2002."},{"key":"24_CR20","unstructured":"Bertrand Mazure, Lakhdar Sa\u00eds, and \u00c9ric Gr\u00e9goire. Tabu search for SAT. In Proc. of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference (AAAI-97\/IAAI-97), pages 281\u2013285, Providence, Rhode Island, 1997."},{"key":"24_CR21","unstructured":"Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Cha.: Engineering an efficient SAT solver. In Proc. of the 38th Design Automation Conference (DAC\u201901), Jun 2001."},{"key":"24_CR22","unstructured":"Bart Selman, Henry A. Kautz, and Bram Cohen. Noise strategies for improving local search. In Proc. of the AAAI, Vol. 1, pages 337\u2013343, 1994."},{"key":"24_CR23","unstructured":"Bart Selman, Hector J. Levesque, and David G. Mitchell. A new method for solving hard satisfiability problems. In Proc. of the AAAI\u201992, pages 440\u2013446, San Jose, CA, 1992."},{"key":"24_CR24","unstructured":"Laurent Simon, Daniel Le Berre, and Edward A. Hirsch. The sat2002 competition. Technical report, Fifth International Symposium on the Theory and Applications of Satisfiability Testing, May 2002."},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"William M. Spears. Simulated annealing for hard satisfiability problems. In Second DIMACS implementation challenge: cliques, coloring and satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 533\u2013558, 1996.","DOI":"10.1090\/dimacs\/026\/26"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Hantao Zhang. SATO: An efficient propositional prover. In Proc. of the 14th International Conference on Automated deduction, volume 1249 of LNAI, pages 272\u2013275, Berlin, 1997.","DOI":"10.1007\/3-540-63104-6_28"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36605-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T01:51:53Z","timestamp":1556934713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36605-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009764","9783540366058"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-36605-9_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}