A hybrid genetic and variable neighborhood descent for probabilistic SAT problem

Authors:
Zoran Ognjanović;Uroš Midić;Nenad Mladenović
Affiliations:
Mathematical Institute, Belgrade, Serbia and Montenegro;Mathematical Institute, Belgrade, Serbia and Montenegro;Mathematical Institute, Belgrade, Serbia and Montenegro
Venue:
HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
Year:
2005

Citing 7
Cited 0

Probabilistic logic

Artificial Intelligence
Probabilistic Satisfiability

Journal of Complexity
A logic for reasoning about probabilities

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Reasoning about knowledge and probability

Journal of the ACM (JACM)
Variable neighborhood search

Computers and Operations Research
Some first-order probability logics

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

ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Quantified Score

Hi-index	0.00

Visualization

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 propositional letters can be solved. They are, to the best of our knowledge, the largest PSAT-problems reported in the literature.