1. T. Bäck. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, 1996.
2. S.A. Cook. The complexity of theorem-proving procedures. In Proc. of the 3rd Annual ACM Symposium on the Theory of Computing, pages 151–158, 1971.
3. K.A. de Jong and W.M. Spears. Using genetic algorithms to solve NP-complete problems. In Third International Conference on Genetic Algorithms, pages 124–132, 1989.
4. M. Davis and H. Putnam. A computing procedure for quantification theory. Jnl. Association for Computing Machinery, 7:201–215, 1960.
5. A.E. Eiben, P.-E. Raué, and Zs. Ruttkay. Repairing, adding constraints and learning as a means of improving GA performance on CSPs. In J.C. Bioch, editor, Proceedings of the 4th Belgian-Dutch Conference on Machine Learning, pages 112–123. Erasmus University Press, 1994.