Particle Swarm Optimization for Satisfiability (SAT)

摘要

This paper introduced a SAT algorithm based upon Particle Swarm Optimization (PSO). PSO was modified by using new velocity updating strategy through the introduction of probability, new swarm behavior was used to deal with multi-model SAT problems. A special class of SAT problems, that is the 3-SAT problems was used to test this algorithm and showed that PSO could efficiently cope with SAT problems, and it should be pointed out that the algorithm can find more than one solutions in one execution.