| Authors: | Ognjanović, Zoran Midić, Uroš Kratica, Jozef |
Affiliations: | Mathematical Institute of the Serbian Academy of Sciences and Arts | Title: | A genetic algorithm for probabilistic SAT problem | Journal: | Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) | Volume: | 3070 | First page: | 462 | Last page: | 467 | Conference: | 7th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2004; Zakopane; Poland; 7 June 2004 through 11 June 2004 | Issue Date: | 9-Dec-2004 | Rank: | M22 | ISSN: | 0302-9743 | DOI: | 10.1007/978-3-540-24844-6_68 | Abstract: | We 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. |
Keywords: | Probabilistic logics | Problem solving | Genetic algorithms | Publisher: | Springer Link |
Show full item record
SCOPUSTM
Citations
7
checked on May 18, 2024
Page view(s)
91
checked on May 9, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.