A Genetic-Based Approach for Satisfiability Problems

  • Mohamed Tounsi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2385)


We present a genetic-based approach to solve SAT problem and NP-complete problems. The main idea of the approach presented here is to exploit the fact that, although all NP-complete problems are equally difficult in a general computational sense, some have much better genetic representations than others, leading to much more successful use of genetic-based algorithm on some NP-complete problems than on others. Since any NP-complete problem can be mapped into any other one in polynomial time by a transformation, the approach described here consists of identifying and finding a canonical or generic NP-complete problem on which genetic algorithm work well, and solving other NP-complete problems indirectly by translating them onto the canonical problem. We presented some initial results where we have the Boolean Satisfiability Problem (SAT) as a canonical problem, and results on Hamiltonian Circuit problem which represent a family of NP-complete problems, it can be solved efficiently by mapping them first onto SAT problems.


SAT Genetic Algorithm NP-complete Problem Hamiltonian Circuit 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ARS93]
    Rudolf F. Albrecht, Colin R. Reeves, and Nigel C. Steele, editors. Artificial neural nets and genetic algorithms. Springer, April 14–16 1993. ANNGA 93, International Conference on Artificial Neural Networks & Genetic Algorithms.Google Scholar
  2. [BEV98]
    Back, Eiben, and Vink. A superior evolutionary algorithm for 3-SAT. In International Conference on Evolutionary Programming, in cooperation with IEEE Neural Networks Council. LNCS, 1998.Google Scholar
  3. [EvdH97]
    Eiben and van der Hauw. Solving 3-SAT by (gas) adapting constraint weights. In Proceedings of The IEEE Conference on Evolutionary Computation, World Congress on Computational Intelligence, 1997.Google Scholar
  4. [Ga84]
    J. Grefenstette and al. Genetic algorithms fot the traveling salesman problem. In Conference on Intelligent Systems and Machines, 1984.Google Scholar
  5. [Gat98]
    Chris Gathercole. An investigation of supervised learning in genetic programming. In Ph.D. thesis. Department of Electronics and Electrical Engineering. University of Edinburg, 1998, 1998.Google Scholar
  6. [GJ79]
    M. Garey and D. Johnsond. Computers and intractability: A guide to the theory of np-completeness. In W. H. Freeman and Company, CA., 1979.zbMATHGoogle Scholar
  7. [GL85]
    D. Goldberg and Robert Lingle. Alleles, loci, and the traveling salesman problem. In Conference on Intelligent Systems and Machines 161–165, 1985.Google Scholar
  8. [Gol89]
    D. Goldberg. Genetic algorithms in search, optmization and machine learning. In Addison Wesley Pubslishing, ISBN:0-201-15767-5, 1989.Google Scholar
  9. [H79]
    Gerald Smith H. Adaptive genetic algorithms and the boolean satisfiability problem. In Conference on genetic algorithm, 1979.Google Scholar
  10. [Hol75]
    J. H. Holland. Adaptation in natural and artificial systems. In The university of Michigan Press, 1975.Google Scholar
  11. [Koz92]
    J.R. Koza. Genetic Programming. MIT Press, 1992.Google Scholar
  12. [Lan98]
    William B. Langdon. Data structures and genetic programming. In Ph.D. thesis. University College, London, 1998.Google Scholar
  13. [LSM92]
    H. Levesque, B. Selman, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceeding of AAAI, pages 440-446, 1992.Google Scholar
  14. [Raw91]
    Gregory J. E. Rawlins, editor. Foundations of Genetic Algorithms, San Mateo, California, 1991. Morgan Kaufmann.Google Scholar
  15. [Rud94]
    Günter Rudolph. Convergence analysis of canonical genetic algorithms. IEEE Trans. Neural Networks, Special Issue on Evolutionary Computation, 5(1):96–101, 1994.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Mohamed Tounsi
    • 1
  1. 1.Computer Science DepartmentEcole des Mines de NantesNantesFrance

Personalised recommendations