DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Genetic algorithms | Probabilistic logics | Satisfiability problems | - |
dc.contributor.author | Ognjanović, Zoran | en |
dc.contributor.author | Kratica, Jozef | en |
dc.contributor.author | Milovanović, Miloš | en |
dc.date.accessioned | 2020-02-18T20:06:32Z | - |
dc.date.available | 2020-02-18T20:06:32Z | - |
dc.date.issued | 2001-01-01 | en |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/81 | - |
dc.description.abstract | This 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.publisher | Springer Link | - |
dc.relation.ispartof | Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) | en |
dc.title | A genetic algorithm for satisfiability problem in a probabilistic logic: A first report | en |
dc.type | Article | en |
dc.relation.conference | European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU 2001 | - |
dc.identifier.doi | 10.1007/3-540-44652-4_71 | - |
dc.identifier.scopus | 2-s2.0-23044531804 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 805 | - |
dc.relation.lastpage | 816 | - |
dc.relation.volume | 2143 | - |
dc.description.rank | M21 | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.openairetype | Article | - |
crisitem.author.orcid | 0000-0003-2508-6480 | - |
crisitem.author.orcid | 0000-0002-9752-0971 | - |
crisitem.author.orcid | 0000-0002-2909-451X | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.