Genetic optimisations for satisfiability and Ramsey theory

Abstract

The art of using evolutionary mechanisms for identifying satisfiability has produced a range of efficient solutions to this otherwise computationally challenging problem. Since their first use these evolutionary methods have been changed and adapted to produce increasingly efficient solutions. This paper introduces two unique alternatives to the optimisation of these methods, the first through the introduction of alternative mutation operators and the second through utilizing a grammatical encoding which has been proven to improve neuroevolution. The goal of this paper is to identify whether these two alternatives are candidates for future investigation in improving evolutionary satisfiability solvers.