Abstract
In this paper we develop a satisfiability checker for probabilistic logic. Our approach is based on a hybrid algorithm which combines genetic algorithm approach with variable neighborhood descent. Our hybrid compares favorable with previous pure genetic algorithm. 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.
This research was supported by Ministarstvo nauke i zaštite životne okoline Republike Srbije, through Matematički institut, under grants 1379 and 1583.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baeck, T., Fogel, D.B., Michalewicz, T. (eds.): Evolutionary computation, vol. I, II. Institute of Physics Publishing, Bristol and Philadelphia (2000)
Fagin, R., Halpern, J., Megiddo, N.: A logic for reasoning about probabilities. Information and Computation 87, 78–128 (1990)
Fagin, R., Halpern, J.: Reasoning about knowledge and probability. Journal of the ACM 41(2), 340–367 (1994)
Georgakopoulos, G., Kavvadias, D., Papadimitriou, C.: Probabilistic satisfiability. Journal of Complexity 4(1), 1–11 (1988)
Hansen, P., Jaumard, B.: Probabilistic satisfiability. In: Dov Gabbay, M., et al. (eds.) Handbook of defeasible reasoning and uncertainty management systems. Algorithms for uncertainty and defeasible reasoning, vol. 5, pp. 321–367. Kluwer Academic Publishers, Dordrecht (2000)
Hansen, P., Mladenović, N.: Variable neighborhood search, Fred. In: Glover, W., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 57, pp. 145–184. Springer, Heidelberg (2003)
Hansen, P., Perron, S.: Merging the Local and Global Approaches to Probabilistic Satisfiability, GERAD tech. report (2004)
Jaumard, B., Hansen, P., de Aragao, M.P.: Column generation methods for probabilistic logic. ORSA Journal on Computing 3, 135–147 (1991)
Kavvadias, D., Papadimitriou, C.: A linear programming approach to reasoning about probabilities. Annals of Mathematics and Artificial Intelligence 1(1-4), 189–205 (1990)
Nilsson, N.: Probabilistic logic. Artificial Intelligence 28, 71–87 (1986)
Mladenović, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24(11), 1097–1100 (1997)
Ognjanović, Z., Rašković, M.: Some first-order probability logics. Theoretical Computer Science 247(1-2), 191–212 (2000)
Ognjanović, Z., Kratica, J., Milovanović, M.: A genetic algorithm for satisfiability problem in a probabilistic logic: A first report. In: Benferhat, S., Besnard, P. (eds.) ECSQARU 2001. LNCS (LNAI), vol. 2143, pp. 805–816. Springer, Heidelberg (2001)
Ognjanović, Z., Midić, U., Kratica, J.: A genetic algorithm for probabilistic SAT problem. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds.) ICAISC 2004. LNCS (LNAI), vol. 3070, pp. 462–467. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ognjanović, Z., Midić, U., Mladenović, N. (2005). A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem. In: Blesa, M.J., Blum, C., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2005. Lecture Notes in Computer Science, vol 3636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546245_5
Download citation
DOI: https://doi.org/10.1007/11546245_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28535-9
Online ISBN: 978-3-540-31898-9
eBook Packages: Computer ScienceComputer Science (R0)