A Genetic Algorithm for Satisfiability Problem in a Probabilistic Logic: A First Report

This paper introduces a genetic algorithm for satisfiability problem in a probabilistic logic. A local search based improvement procedure is integrated in the algorithm. A test methodology is presented and some results are given. The results indicate that this approach could work well Some directions for further research are described.