DC FieldValueLanguage
dc.contributor.authorJovanović, Dejanen
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorOgnjanović, Zoranen
dc.date.accessioned2020-02-18T20:06:30Z-
dc.date.available2020-02-18T20:06:30Z-
dc.date.issued2007-12-01en
dc.identifier.isbn978-0-387-71919-1-
dc.identifier.issn1387-666Xen
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/66-
dc.description.abstractThis paper presents a new method for the probabilistic logic satisfiability problem, based on the variable neighborhood search metaheuristic. The solution space consists of 0-1 variables, while the associated probabilities are found by our fast approximate variable neighborhood descent procedure combined with the Nelder-Mead nonlinear optimization method. Computational experience shows that, with our approach, problem instances with up to 200 propositional letters can be solved successfully. They are, to the best of our knowledge, the largest solved instances of the PSAT problem that appeared in the literature.en
dc.publisherSpringer Link-
dc.relation.ispartofMetaheuristicsen
dc.relation.ispartofseriesOperations Research: Computer Science Interfaces Series-
dc.subjectProbabilistic logic | Probabilistic satisfiability | Variable neighborhood searchen
dc.titleVariable neighborhood search for the probabilistic satisfiability problemen
dc.typeBook Chapteren
dc.identifier.doi10.1007/978-0-387-71921-4_9-
dc.identifier.scopus2-s2.0-84888619032en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage173-
dc.relation.lastpage188-
dc.relation.volume39-
dc.description.rankM14-
item.openairetypeBook Chapter-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0003-2508-6480-
Show simple item record

SCOPUSTM   
Citations

7
checked on Jun 11, 2024

Page view(s)

124
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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