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

  • Authors:
  • Zoran Ognjanovic;Jozef Kratica;Milos Milovanovic

  • Affiliations:
  • -;-;-

  • Venue:
  • ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.