This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
UKSim 2009: 11th International Conference on Computer Modelling and Simulation
An Enhanced Fuzzy-Genetic Algorithm to Solve Satisfiability Problems
March 25-March 27
ISBN: 978-0-7695-3593-7
The satisfiability is a decision problem that belongs toNP-complete class and has significant applications invarious areas of computer science. Several works haveproposed high-performance algorithms and solvers toexplore the space of variables and look for satisfyingassignments. Pedrycz, Succi and Shai [1] have studieda fuzzy-genetic approach which demonstrates that aformula of variables can be satisfiable by assigningBoolean variables to partial true values between 0 and1. In this paper we improve this approach by proposingan improved fuzzy-genetic algorithm to avoidundesired convergence of variables to 0.5. Thealgorithm includes a repairing function that eliminatesthe recursion and maintains a reasonable computationalconvergence and adaptable population generation.Implementation and experimental results demonstratethe enhancement of solving satisfiability problems.
Index Terms:
Satisfiability, Genetic Algorithms, fuzzy logic, NP-Completeness, Evolutionary Computation
Citation:
José Francisco Saray Villamizar, Youakim Badr, Ajith Abraham, "An Enhanced Fuzzy-Genetic Algorithm to Solve Satisfiability Problems," uksim, pp.77-82, UKSim 2009: 11th International Conference on Computer Modelling and Simulation, 2009
Usage of this product signifies your acceptance of the Terms of Use.