DC FieldValueLanguage
dc.contributor.authorStojanović, Tatjanaen
dc.contributor.authorDavidović, Tatjanaen
dc.contributor.authorOgnjanović, Zoranen
dc.date.accessioned2020-02-18T20:06:25Z-
dc.date.available2020-02-18T20:06:25Z-
dc.date.issued2015-06-01en
dc.identifier.issn1568-4946en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/24-
dc.description.abstractThis 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.en
dc.publisherElsevier-
dc.relationDevelopment of new information and communication technologies, based on advanced mathematical methods, with applications in medicine, telecommunications, power systems, protection of national heritage and education-
dc.relationMatematički modeli i metode optimizacije sa primenama-
dc.relationUpravljanje saobraćajem i transportom primenom modela zasnovanih na metodama matematičkog programiranja i mekog računa-
dc.relationDevelopmet of decision support system for large dam maintenance in Serbia-
dc.relation.ispartofApplied Soft Computing Journalen
dc.subjectApproximate probability | Conditional probability | Meta-heuristics | Probabilistic satisfiability | Swarm intelligenceen
dc.titleBee colony optimization for the satisfiability problem in probabilistic logicen
dc.typeArticleen
dc.identifier.doi10.1016/j.asoc.2015.03.017en
dc.identifier.scopus2-s2.0-84961290119en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.grantnoOI144007-
dc.relation.grantnoOI144033-
dc.relation.firstpage339-
dc.relation.lastpage347-
dc.relation.volume31-
dc.description.rankM21-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-9561-5339-
crisitem.author.orcid0000-0003-2508-6480-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/044006e.php-
crisitem.project.fundingProgramNATIONAL HEART, LUNG, AND BLOOD INSTITUTE-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NIH/NATIONAL HEART, LUNG, AND BLOOD INSTITUTE/5R01HL044006-04-
Show simple item record

SCOPUSTM   
Citations

6
checked on Jun 20, 2024

Page view(s)

87
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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