| Authors: | Ognjanović, Zoran Kratica, Jozef Milovanović, Miloš |
Affiliations: | Mathematical Institute of the Serbian Academy of Sciences and Arts | Title: | A genetic algorithm for satisfiability problem in a probabilistic logic: A first report | Journal: | Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) | Volume: | 2143 | First page: | 805 | Last page: | 816 | Conference: | European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, ECSQARU 2001 | Issue Date: | 1-Jan-2001 | Rank: | M21 | ISSN: | 0302-9743 | DOI: | 10.1007/3-540-44652-4_71 | 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. |
Publisher: | Springer Link |
Show full item record
SCOPUSTM
Citations
7
checked on Apr 23, 2024
Page view(s)
84
checked on Apr 24, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.