A Hybrid Genetic Algorithm for the Satisfiability Problem
暂无分享,去创建一个
[1] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances , 1996, CP.
[2] Jin-Kao Hao,et al. A New Population-Based Method for Satisfiability Problems , 1994, ECAI.
[3] Elena Marchiori,et al. Evolutionary Algorithms for the Satisfiability Problem , 2002, Evolutionary Computation.
[4] Elena Marchiori,et al. Finding simplest pattern structures using genetic programming , 2001 .
[5] Jano I. van Hemert,et al. Graph Coloring with Adaptive Evolutionary Algorithms , 1998, J. Heuristics.
[6] John N. Hooker,et al. Resolution and the integrality of satisfiability problems , 1996, Math. Program..
[7] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[8] Kenneth A. De Jong,et al. Measurement of Population Diversity , 2001, Artificial Evolution.
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[11] Chu Min Li,et al. Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.
[12] Kenneth A. De Jong,et al. Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.
[13] Benjamin W. Wah,et al. Discrete Lagrangian-Based Search for Solving MAX-SAT Problems , 1997, IJCAI.
[14] Manuel Laguna,et al. Tabu Search , 1997 .
[15] Richard W. Hamming,et al. Error detecting and error correcting codes , 1950 .
[16] Lakhdar Sais,et al. Theoretical Study of Symmetries in Propositional Calculus and Applications , 1992, CADE.
[17] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[18] Rémi Monasson,et al. Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.
[19] William M. Spears,et al. Simulated annealing for hard satisfiability problems , 1993, Cliques, Coloring, and Satisfiability.
[20] Charles Fleurent,et al. Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..
[21] Jacques Carlier,et al. SAT versus UNSAT , 1993, Cliques, Coloring, and Satisfiability.
[22] Hantao Zhang,et al. SATO: An Efficient Propositional Prover , 1997, CADE.
[23] Chu Min Li,et al. Integrating Equivalency Reasoning into Davis-Putnam Procedure , 2000, AAAI/IAAI.
[24] Gilles Dequen,et al. A backbone-search heuristic for efficient solving of hard 3-SAT formulae , 2001, IJCAI.
[25] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.