Authors: Ognjanović, Zoran 
Midić, Uroš
Mladenović, Nenad 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: A hybrid genetic and variable neighborhood descent for probabilistic SAT problem
Journal: Lecture Notes in Computer Science
Volume: 3636
First page: 42
Last page: 53
Conference: Second International Worshop on Hybrid Metaheuristics, HM 2005; Barcelona; Spain; 29 August 2005 through 30 August 2005
Issue Date: 1-Jan-2005
Rank: M22
ISSN: 0302-9743
DOI: 10.1007/11546245_5
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.
Publisher: Springer Link
Project: Methods of Mathematical Logic for Decision Support in Real Life Situations 
Mathematical optimization models and methods with applications 

Show full item record


checked on Aug 18, 2022

Page view(s)

checked on Aug 18, 2022

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.