pEvoSAT: a novel permutation based genetic algorithm for solving the boolean satisfiability problem

Authors:
Boris Shabash;Kay C. Wiese
Affiliations:
Simon Fraser University, Burnaby, British Columbia, Canada;Simon Fraser University, Burnaby, British Columbia, Canada
Venue:
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Year:
2013

Citing 10
Cited 0

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Keep-Best Reproduction: A Local Family Competition Selection Strategy and the Environment it Flourishes in

Constraints
Evolutionary algorithms for the satisfiability problem

Evolutionary Computation
AllelesLociand the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
GASAT: a genetic local search algorithm for the satisfiability problem

Evolutionary Computation
RnaPredict—An Evolutionary Algorithm for RNA Secondary Structure Prediction

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Speeding up the evaluation of evolutionary learning systems using GPGPUs

Proceedings of the 12th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce pEvoSAT, a permutation based Genetic Algorithm (GA), designed to solve the boolean satisfiability (SAT) problem when it is presented in the conjunctive normal form (CNF). The use of permutation based representation allows the algorithm to take advantage of domain specific knowledge such as unit propagation, and pruning. In this paper, we explore and characterize the behavior of our algorithm. This paper also presents the comparison of pEvoSAT to GASAT, a leading implementation of GAs for the solving of CNF instances.