Genetic Programming and Genetic Algorithms for Propositions

In this paper we propose a mechanism to discover the compound proposition solutions for a given truth table without knowing the compound propositions that lead to the truth table results. The approach is based on two proposed algorithms, the first is called Producing Formula (PF) algorithm which is based on the genetic programming idea, to find out the compound proposition solutions for the given truth table. The second algorithm is called the Solutions Optimization (SO) algorithm which is based on genetic algorithms idea, to find a list of the optimum compound propositions that can solve the truth table. The obtained list will depend on the solutions obtained from the PF algorithm. Various types of genetic operators have been introduced to obtain the solutions either within the PF algorithm or SO algorithm.