We describe new results in developing of a satisfiability checker for probabilistic logic based on the genetic algorithm approach combined with a local search procedure. Computational experiences show that problems with 200 propositional letters can be solved. They are, to the best of our knowledge, the largest PSAT-problems reported in the literature.
CITATION STYLE
Ognjanović, Z., Midić, U., & Kratica, J. (2004). A genetic algorithm for probabilistic SAT problem. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3070, pp. 462–467). Springer Verlag. https://doi.org/10.1007/978-3-540-24844-6_68
Mendeley helps you to discover research relevant for your work.