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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baeck, T., Eiben, A.E., Vink, M.E.: A superior evolutionary algorithm for 3-SAT. LNCS, vol. 1744, pp. 125–136 (1998)
Baeck, T., Fogel, D.B., Michalewicz, T. (eds.): Evolutionary computation, vol. I, II. Institute of Physics Publishing, Bristol (2000)
Fagin, R., Halpern, J., Megiddo, N.: A logic for reasoning about probabilities. Information and Computation 87, 78–128 (1990)
Georgakopoulos, G., Kavvadias, D., Papadimitriou, C.: Probabilistic satisfiability. Journal of Complexity 4(1), 1–11 (1988)
Hansen, P., Jaumard, B., Nguetse, G.-B.D., de Aragao, M.P.: Models and algorithms for probabilistic and Bayesian logic. In: IJCAI 1995, pp. 1862–1868 (1995)
Jaumard, B., Hansen, P., de Aragao, M.P.: Column generation methods for probabilistic logic. ORSA Journal on Computing 3, 135–147 (1991)
Kratica, J.: Improving Performances of the Genetic Algorithm by Caching. Computers and Artificial Intelligence 18(3), 271–283 (1999)
Kratica, J., Ljubić, I., Tošić, D.: A genetic algorithm for the index selection problem. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol. 2611, pp. 281–291. Springer, Heidelberg (2003)
Marchiori, E., Rossi, C.: A flipping genetic algorithm for hard 3-SAT problems. In: Proc. of the GECCO 1999, pp. 393–400 (1999)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ognjanović, Z., Midić, U., Kratica, J. (2004). A Genetic Algorithm for Probabilistic SAT Problem. In: Rutkowski, L., Siekmann, J.H., Tadeusiewicz, R., Zadeh, L.A. (eds) Artificial Intelligence and Soft Computing - ICAISC 2004. ICAISC 2004. Lecture Notes in Computer Science(), vol 3070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24844-6_68
Download citation
DOI: https://doi.org/10.1007/978-3-540-24844-6_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22123-4
Online ISBN: 978-3-540-24844-6
eBook Packages: Springer Book Archive