DC FieldValueLanguage
dc.contributor.authorOgnjanović, Zoranen
dc.contributor.authorMidić, Urošen
dc.contributor.authorKratica, Jozefen
dc.date.accessioned2020-02-18T20:06:32Z-
dc.date.available2020-02-18T20:06:32Z-
dc.date.issued2004-12-09en
dc.identifier.issn0302-9743en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/77-
dc.description.abstractWe describe new results in developing of a satisfiability checker for probabilistic logic based on the genetic algorithm approach combined with a local search procedure. Computational experiences show that problems with 200 propositional letters can be solved. They are, to the best of our knowledge, the largest PSAT-problems reported in the literature.en
dc.publisherSpringer Link-
dc.relation.ispartofLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)en
dc.subjectProbabilistic logics | Problem solving | Genetic algorithms-
dc.titleA genetic algorithm for probabilistic SAT problemen
dc.typeArticleen
dc.relation.conference7th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2004; Zakopane; Poland; 7 June 2004 through 11 June 2004-
dc.identifier.doi10.1007/978-3-540-24844-6_68-
dc.identifier.scopus2-s2.0-9444234552en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage462-
dc.relation.lastpage467-
dc.relation.volume3070-
dc.description.rankM22-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.orcid0000-0003-2508-6480-
crisitem.author.orcid0000-0002-9752-0971-
Show simple item record

SCOPUSTM   
Citations

7
checked on Nov 22, 2024

Page view(s)

17
checked on Nov 23, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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