DC FieldValueLanguage
dc.contributor.advisorGenetic algorithms | Probabilistic logics | Satisfiability problems-
dc.contributor.authorOgnjanović, Zoranen
dc.contributor.authorKratica, Jozefen
dc.contributor.authorMilovanović, Milošen
dc.date.accessioned2020-02-18T20:06:32Z-
dc.date.available2020-02-18T20:06:32Z-
dc.date.issued2001-01-01en
dc.identifier.issn0302-9743-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/81-
dc.description.abstractThis paper introduces a genetic algorithm for satisfiability problem in a probabilistic logic. A local search based improvement procedure is integrated in the algorithm. A test methodology is presented and some results are given. The results indicate that this approach could work well. Some directions for further research are described.en
dc.publisherSpringer Link-
dc.relation.ispartofLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)en
dc.titleA genetic algorithm for satisfiability problem in a probabilistic logic: A first reporten
dc.typeArticleen
dc.relation.conferenceEuropean Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU 2001-
dc.identifier.doi10.1007/3-540-44652-4_71-
dc.identifier.scopus2-s2.0-23044531804en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage805-
dc.relation.lastpage816-
dc.relation.volume2143-
dc.description.rankM21-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-2508-6480-
crisitem.author.orcid0000-0002-9752-0971-
crisitem.author.orcid0000-0002-2909-451X-
Show simple item record

SCOPUSTM   
Citations

7
checked on Apr 2, 2025

Page view(s)

21
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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