Recombination Operators for Satisfiability Problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2936, Issue , 2004, Pages 103-114

  Lardeux, Fréd́ric ^a   Saubion, Frédéric ^a   Hao, Jin Kao ^a  

^a UNIVERSITÉ D'ANGERS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

HYBRID GENETIC; PROBLEM INSTANCES; RECOMBINATION OPERATORS; RELATIVE PERFORMANCE; SAT PROBLEMS; SATISFIABILITY PROBLEMS; SEMANTIC INFORMATION;

FORMAL LOGIC;

EID: 35048833833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24621-3_9     Document Type: Article

References (19)

1. Belaid Benhamou and Lakhdar Sais. Theoretical study of symmetries in prepositional calculus and applications. In CADE'92, pages 281-294, 1992.
2. Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Communications of the ACM, 5(7):394-397, Jul 1962.
3. 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-132, San Mateo, CA, 1989.
4. 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'01, pages 248-253, San Francisco, CA, 2001.
5. Charles Fleurent and Jacques A. Ferland. Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. In Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 619-652, 1994.
6. 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.
7. Jens Gottlieb, Elena Marchiori, and Claudio Rossi. Evolutionary algorithms for the satisfiability problem. Evolutionary Computation, 10(1):35-50, 2002.
8. Pierre Hansen and Brigitte Jaumard. Algorithms for the maximum satisfiability problem. Computing, 44(4):279-303, 1990.
9. Jin-Kao Hao, Frédéric Lardeux, and Frédéric Saubion. Evolutionary computing for the satisfiability problem. In Applications of Evolutionary Computing, volume 2611 of LNCS, pages 259-268, 2003.
10. 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.
11. Brigitte Jaumard, Mihnea Stan, and Jacques Desrosiers. Tabu search and a quadratic relaxation for the satisfiability problem. In Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 457-478, 1994.
12. Chu Min Li. Integrating equivalency reasoning into davis-putnam procedure. In Proc. of the AAAI'00, pages 291-296, 2000.
13. Chu Min Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proc. of the IJCAI'97, pages 366-371, 1997.
14. Elena Marchiori and Claudio Rossi. A flipping genetic algorithm for hard 3-SAT problems. In. Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 393-400, 1999.
15. Bart Selman, Henry A. Kautz, and Bram Cohen. Noise strategies for improving local search. In Proc. of the AAAI, Vol. 1, pages 337-343, 1994.
16. Bart Selman, Hector J. Levesque, and David G. Mitchell. A new method for solving hard satisfiability problems. In Proc. of the AAAI'92, pages 440-446, San Jose, CA, 1992.
17. 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.
18. Mutsunori Yagiura and Toshihide Ibarak. Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: Experimental evaluation. Journal of Heuristics, 7(5):423-442, 2001.
19. Hantao Zhang. SATO: An efficient propositional prover. In Proc. of the 14th International Conference on Automated deduction, volume 1249 of LNAI, pages 272-275, Berlin, 1997.