A hybrid genetic and variable neighborhood descent for probabilistic SAT problem

Abstract

In this paper we develop a satisfiability checker for probabilistic logic. Our approach is based on a hybrid algorithm which combines genetic algorithm approach with variable neighborhood descent. Our hybrid compares favorable with previous pure genetic algorithm. Computational experiences show that problems with 200 prepositional letters can be solved. They are, to the best of our knowledge, the largest PSAT-problems reported in the literature.