{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:33:45Z","timestamp":1761597225818},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221234"},{"type":"electronic","value":"9783540248446"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24844-6_68","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T03:21:19Z","timestamp":1284175279000},"page":"462-467","source":"Crossref","is-referenced-by-count":5,"title":["A Genetic Algorithm for Probabilistic SAT Problem"],"prefix":"10.1007","author":[{"given":"Zoran","family":"Ognjanovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uro\u0161","family":"Midi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jozef","family":"Kratica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"crossref","unstructured":"Baeck, T., Eiben, A.E., Vink, M.E.: A superior evolutionary algorithm for 3-SAT. LNCS, vol.\u00a01744, pp. 125\u2013136 (1998)","DOI":"10.1007\/BFb0040766"},{"volume-title":"Evolutionary computation","year":"2000","key":"68_CR2","unstructured":"Baeck, T., Fogel, D.B., Michalewicz, T. (eds.): Evolutionary computation, vol.\u00a0I, II. Institute of Physics Publishing, Bristol (2000)"},{"key":"68_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0890-5401(90)90060-U","volume":"87","author":"R. Fagin","year":"1990","unstructured":"Fagin, R., Halpern, J., Megiddo, N.: A logic for reasoning about probabilities. Information and Computation\u00a087, 78\u2013128 (1990)","journal-title":"Information and Computation"},{"issue":"1","key":"68_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0885-064X(88)90006-4","volume":"4","author":"G. Georgakopoulos","year":"1988","unstructured":"Georgakopoulos, G., Kavvadias, D., Papadimitriou, C.: Probabilistic satisfiability. Journal of Complexity\u00a04(1), 1\u201311 (1988)","journal-title":"Journal of Complexity"},{"key":"68_CR5","unstructured":"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\u20131868 (1995)"},{"key":"68_CR6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/ijoc.3.2.135","volume":"3","author":"B. Jaumard","year":"1991","unstructured":"Jaumard, B., Hansen, P., de Aragao, M.P.: Column generation methods for probabilistic logic. ORSA Journal on Computing\u00a03, 135\u2013147 (1991)","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"68_CR7","first-page":"271","volume":"18","author":"J. Kratica","year":"1999","unstructured":"Kratica, J.: Improving Performances of the Genetic Algorithm by Caching. Computers and Artificial Intelligence\u00a018(3), 271\u2013283 (1999)","journal-title":"Computers and Artificial Intelligence"},{"key":"68_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-36605-9_26","volume-title":"Applications of Evolutionary Computing","author":"J. Kratica","year":"2003","unstructured":"Kratica, J., Ljubi\u0107, I., To\u0161i\u0107, 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.\u00a02611, pp. 281\u2013291. Springer, Heidelberg (2003)"},{"key":"68_CR9","unstructured":"Marchiori, E., Rossi, C.: A flipping genetic algorithm for hard 3-SAT problems. In: Proc. of the GECCO 1999, pp. 393\u2013400 (1999)"},{"issue":"1-2","key":"68_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0304-3975(98)00341-7","volume":"247","author":"Z. Ognjanovi\u0107","year":"2000","unstructured":"Ognjanovi\u0107, Z., Ra\u0161kovi\u0107, M.: Some first-order probability logics. Theoretical Computer Science\u00a0247(1-2), 191\u2013212 (2000)","journal-title":"Theoretical Computer Science"},{"key":"68_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/3-540-44652-4_71","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"Z. Ognjanovi\u0107","year":"2001","unstructured":"Ognjanovi\u0107, Z., Kratica, J., Milovanovi\u0107, 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.\u00a02143, pp. 805\u2013816. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing - ICAISC 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24844-6_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:22Z","timestamp":1605761842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24844-6_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221234","9783540248446"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24844-6_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}