A hybrid genetic and variable neighborhood descent for probabilistic SAT problem

Lecture Notes in Computer Science

Volumn 3636, Issue , 2005, Pages 42-53

  Ognjanović, Zoran ^a   Midić, Uroš ^a   Mladenović, Nenad ^a,b  

^a MATHEMATICAL INSTITUTE   (Serbia)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBABILISTIC LOGICS;

HYBRID ALGORITHM; PSAT-PROBLEMS; SATISFIABILITY CHECKER; VARIABLE NEIGHBOURHOOD DESCENT;

PROBLEM SOLVING;

EID: 26944448923     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11546245_5     Document Type: Conference Paper

References (14)

1. Evolutionary computation, Vol. I, II, T. Baeck, D. B. Fogel, and T. Michalewicz edts., Institute of Physics Publishing, Bristol and Philadelphia, 2000.
2. R. Fagin, J. Halpern, and N. Megiddo. A logic for reasoning about probabilities.Information and Computation, 87:78-128, 1990.
3. R. Fagin and J. Halpern. Reasoning about knowledge and probability. Journal of the ACM, 41(2), 340-367, 1994.
4. G. Georgakopoulos, D. Kavvadias, and C. Papadimitriou. Probabilistic satisfiability. Journal of Complexity, 4(1):1-11, 1988.
5. P. Hansen, B. Jaumard, Probabilistic satisfiability, in Gabbay, Dov M. (ed.) et al., Handbook of defeasible reasoning and uncertainty management systems. Vol. 5: Algorithms for uncertainty and defeasible reasoning. Dordrecht: Kluwer Academic Publishers. 321-367, 2000.
6. P. Hansen, N. Mladenović, Variable neighborhood search, Fred in W. Glover and Gary A. Kochenberger (edts.), Handbook of Metaheurists,International Series in Operations Research and Management Science, Vol. 57, Springer, 145-184, 2003.
7. P. Hansen, S. Perron. Merging the Local and Global Approaches to Probabilistic Satisfiability, GERAD tech. report, 2004.
8. B. Jaumard, P. Hansen, and M. P. de Aragao. Column generation methods for probabilistic logic. ORSA Journal on Computing, 3:135-147, 1991.
9. D. Kavvadias, and C. Papadimitriou. A linear programming approach to reasoning about probabilities. Annals of Mathematics and Artificial Intelligence, vol. 1, No. 1-4, 189-205, 1990.
10. N. Nilsson. Probabilistic logic. Artificial Intelligence, 28:71-87, 1986.
11. N. Mladenovic, P. Hansen, Variable neighborhood search, Computers and Operations Research, vol. 24, no. 11, 1097-1100, 1997.
12. Z. Ognjanović and M. Rašković. Some first-order probability logics. Theoretical Computer Science, 247(1-2):191-212, 2000.
13. Z. Ognjanović, J. Kratica, M. Milovanović. A genetic algorithm for satisfiability problem in a probabilistic logic: A first report. LNCS 2143, 805-816, 2001.
14. Z. Ognjanović, U. Midić, J. Kratica. A genetic algorithm for probabilistic SAT problem. LNCS 3070, 462-467, 2004.