Authors: Stojanović, Tatjana
Davidović, Tatjana 
Ognjanović, Zoran 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Bee colony optimization for the satisfiability problem in probabilistic logic
Journal: Applied Soft Computing Journal
Volume: 31
First page: 339
Last page: 347
Issue Date: 1-Jun-2015
Rank: M21
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2015.03.017
This paper presents the first heuristic method for solving the satisfiability problem in the logic with approximate conditional probabilities. This logic is very suitable for representing and reasoning with uncertain knowledge and for modeling default reasoning. The solution space consists of variables, which are arrays of 0 and 1 and the associated probabilities. These probabilities belong to a recursive non-Archimedean Hardy field which contains all rational functions of a fixed positive infinitesimal. Our method is based on the bee colony optimizationmeta-heuristic. The proposed procedure chooses variables from the solution space and determines their probabilities combining some other fast heuristics for solving the obtained linear system of inequalities. Experimental evaluation shows a high percentage of success in proving the satisfiability of randomly generated formulas. We have also showed great advantage in using a heuristic approach compared to standard linear solver.
Keywords: Approximate probability | Conditional probability | Meta-heuristics | Probabilistic satisfiability | Swarm intelligence
Publisher: Elsevier
Project: Development of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education 
Matematički modeli i metode optimizacije sa primenama
Upravljanje saobraćajem i transportom primenom modela zasnovanih na metodama matematičkog programiranja i mekog računa
Developmet of decision support system for large dam maintenance in Serbia 

Show full item record


checked on May 29, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




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