{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:26Z","timestamp":1761597026443},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424642"},{"type":"electronic","value":"9783540446521"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44652-4_71","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:39:07Z","timestamp":1180672747000},"page":"805-816","source":"Crossref","is-referenced-by-count":7,"title":["A Genetic Algorithm for Satisfiability Problem in a Probabilistic Logic: A First Report"],"prefix":"10.1007","author":[{"given":"Zoran","family":"Ognjanovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jozef","family":"Kratica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milos","family":"Milovanovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"71_CR1","series-title":"Lect Notes Comput Sci","first-page":"125","volume-title":"Proc. of the 7th Annual Conference on Evolutionary Programming","author":"T. B\u00e4ck","year":"1998","unstructured":"T. B\u00e4ck, A. E. Eiben, and M. E. Vink. A superior evolutionary algorithm for 3-SAT. In Proc. of the 7th Annual Conference on Evolutionary Programming, LNCS 1744, 125\u2013136, 1998."},{"issue":"2","key":"71_CR2","first-page":"58","volume":"15","author":"D. Beasley","year":"1993","unstructured":"D. Beasley, D. R. Bull, and R. R. Martin. An Overview of Genetic Algorithms, Part 1: Fundamentals. University Computing, Vol. 15, No. 2, pp. 58\u201369, 1993.","journal-title":"University Computing"},{"key":"71_CR3","first-page":"859","volume":"2","author":"A. Cano","year":"1996","unstructured":"A. Cano and S. Moral. A genetic algorithm to approximate convex sets of probabilities. In Proc. of the IPMU-96, Vol. 2, 859\u2013864, 1996.","journal-title":"Proc. of the IPMU-96"},{"key":"71_CR4","unstructured":"P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In Proc. of the IJCAI-91. 331\u2013337, 1991."},{"key":"71_CR5","unstructured":"K. A. De Jong and W. M. Spears. Using genetic algorithms to solve NP-complete problems. In 3th International Conference on Genetic Algorithms, 124\u2013132. 1989."},{"key":"71_CR6","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0890-5401(90)90060-U","volume":"87","author":"R. Fagin","year":"1990","unstructured":"R. Fagin, J. Halpern, and N. Megiddo. A logic for reasoning about probabilities. Information and Computation, 87:78\u2013128, 1990.","journal-title":"Information and Computation"},{"issue":"2","key":"71_CR7","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/174652.174658","volume":"41","author":"R. Fagin","year":"1994","unstructured":"R. Fagin and J. Halpern. Reasoning about knowledge and probability. JACM, 41(2):340\u2013367, 1994.","journal-title":"JACM"},{"key":"71_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0004-3702(94)90079-5","volume":"69","author":"A. Frish","year":"1994","unstructured":"A. Frish and P. Haddawy. Anytime deduction for probabilistic logic. Artificial Intelligence, 69:93\u2013122, 1994.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"71_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0885-064X(88)90006-4","volume":"4","author":"G. Georgakopoulos","year":"1988","unstructured":"G. Georgakopoulos, D. Kavvadias, and C. Papadimitriou. Probabilistic satisfiability. Journal of Complexity, 4(1):1\u201311, 1988.","journal-title":"Journal of Complexity"},{"key":"71_CR10","first-page":"412p","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D. E. Goldberg","year":"1989","unstructured":"D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Weseley Publ. Reading, Mass., 412p, 1989."},{"key":"71_CR11","doi-asserted-by":"crossref","unstructured":"J. Y. Halpern. A logical approach to reasoning about uncertainty: A tutorial. In X. Arrazola, K. Korta, and F. J. Pelletier, editors, Discourse, Interaction, and Communication. Kluwer, 1997.","DOI":"10.1007\/978-94-015-8994-9_8"},{"key":"71_CR12","unstructured":"P. Hansen, B. Jaumard, G.-B. D. Nguetse, and M. P. de Aragao. Models and algorithms for probabilistic and Bayesian logic. In Proceedings IJCAI-95, 1862\u20131868, 1995."},{"key":"71_CR13","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. H. Holland","year":"1975","unstructured":"J. H. Holland. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor 1975."},{"key":"71_CR14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/ijoc.3.2.135","volume":"3","author":"B. Jaumard","year":"1991","unstructured":"B. Jaumard, P. Hansen, and M. P. de Aragao. Column generation methods for probabilistic logic. ORSA Journal on Computing, 3:135\u2013147, 1991.","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"71_CR15","first-page":"271","volume":"18","author":"J. Kratica","year":"1999","unstructured":"J. Kratica. Improving Performances of the Genetic Algorithm by Caching. Computers and Artificial Intelligence, Vol. 18, No. 3, pp. 271\u2013283, 1999.","journal-title":"Computers and Artificial Intelligence"},{"key":"71_CR16","unstructured":"J. Kratica. Parallelization of Genetic Algorithms for Solving Some NP-Complete Problems. Ph.D. thesis, University of Belgrade, Faculty of Mathematics, 2000. (in Serbian)"},{"key":"71_CR17","unstructured":"E. Marchiori, and C. Rossi. A flipping genetic algorithm for hard 3-SAT problems. In Proc. of the Genetic and Evolutionary Computation Conference, 1999."},{"key":"71_CR18","doi-asserted-by":"crossref","unstructured":"E. Marchiori, and A. Steenbeek. A genetic local search algorithm for random binary constraint satisfaction problems. In Proc. of the SAC2000.","DOI":"10.1145\/335603.335910"},{"key":"71_CR19","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","volume":"28","author":"N. Nilsson","year":"1986","unstructured":"N. Nilsson. Probabilistic logic. Artificial Intelligence, 28:71\u201387, 1986.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"71_CR20","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1093\/logcom\/9.2.181","volume":"9","author":"Z. Ognjanovi\u0107","year":"1999","unstructured":"Z. Ognjanovi\u0107 and M. Raskovi\u0107. Some probability logics with new types of probability operators. Journal of Logic and Computation, 9(2):181\u2013195, 1999.","journal-title":"Journal of Logic and Computation"},{"issue":"1\u20132","key":"71_CR21","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0304-3975(98)00341-7","volume":"247","author":"Z. Ognjanovi\u0107","year":"2000","unstructured":"Z. Ognjanovi\u0107 and M. Raskovi\u0107. Some first-order probability logics. Theoretical Computer Science, 247(1\u20132):191\u2013212, 2000.","journal-title":"Theoretical Computer Science"},{"issue":"67","key":"71_CR22","first-page":"1","volume":"53","author":"M. Raskovi\u0107","year":"1993","unstructured":"M. Raskovi\u0107. Classical logic with some probability operators. Publications de l\u2019Institut Math\u00e9matique, Nouvelle S\u00e9rie, Beograd, 53(67):1\u20133, 1993.","journal-title":"Publications de l\u2019Institut Math\u00e9matique, Nouvelle S\u00e9rie, Beograd"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44652-4_71","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:22:43Z","timestamp":1556464963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44652-4_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424642","9783540446521"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-44652-4_71","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}