{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:19:48Z","timestamp":1725560388971},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287025"},{"type":"electronic","value":"9783540318675"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_51","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:05:47Z","timestamp":1127829947000},"page":"591-602","source":"Crossref","is-referenced-by-count":1,"title":["Random Databases and Threshold for Monotone Non-recursive Datalog"],"prefix":"10.1007","author":[{"given":"Konstantin","family":"Korovin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Voronkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","series-title":"London Math. Soc. Lecture Note Ser","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1017\/CBO9780511662157.006","volume-title":"Combinatorics (Swansea, 1981)","author":"B. Bollob\u00e1s","year":"1981","unstructured":"Bollob\u00e1s, B.: Random graphs. In: Combinatorics (Swansea, 1981). London Math. Soc. Lecture Note Ser, vol.\u00a052, pp. 80\u2013102. Cambridge Univ. Press, Cambridge (1981)"},{"key":"51_CR2","volume-title":"Random graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B.: Random graphs. Academic Press Inc, London (1985)"},{"key":"51_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02579198","volume":"7","author":"B. Bollob\u00e1s","year":"1987","unstructured":"Bollob\u00e1s, B., Thomason, A.: Threshold functions. Combinatorica\u00a07, 35\u201338 (1987)","journal-title":"Combinatorica"},{"key":"51_CR4","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1145\/212433.212479","volume-title":"Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"M. Rougemont de","year":"1995","unstructured":"de Rougemont, M.: The reliability of queries. In: Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Jose, California, May 22-25, pp. 286\u2013291. ACM Press, New York (1995)"},{"key":"51_CR5","volume-title":"Perspectives in Mathematical Logic","author":"H.-D. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. In: Perspectives in Mathematical Logic, Springer, Heidelberg (1999)"},{"key":"51_CR6","first-page":"17","volume":"5","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u0151zl\u00a05, 17\u201361 (1960)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u0151zl"},{"key":"51_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.2307\/2272945","volume":"41","author":"R. Fagin","year":"1976","unstructured":"Fagin, R.: Probabilities on finite models. Journal of Symbolic Logic\u00a041, 50\u201358 (1976)","journal-title":"Journal of Symbolic Logic"},{"issue":"4","key":"51_CR8","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"E. Friedgut","year":"1999","unstructured":"Friedgut, E.: Sharp thresholds of graph properties, and the k-sat problem. J. Amer. Math. Soc.\u00a012(4), 1017\u20131054 (1999)","journal-title":"J. Amer. Math. Soc."},{"key":"51_CR9","first-page":"17","volume":"5","author":"Y. Glebskii","year":"1969","unstructured":"Glebskii, Y., Kogan, M., Liogonkii, M., Talanov, V.: Range and degree of realizability of formulas in the restricted predicate calculus. Kibernetika\u00a05, 17\u201327 (1969) (in Russian); English translation in Cybernetics 5, 142\u2013154 (1969)","journal-title":"Kibernetika"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1145\/275487.295124","volume-title":"Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"E. Gr\u00e4del","year":"1998","unstructured":"Gr\u00e4del, E., Gurevich, Y., Hirsch, C.: The complexity of query reliability. In: Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Seattle, Washington, June 1-3, pp. 227\u2013234. ACM Press, New York (1998)"},{"key":"51_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random graphs","author":"S. Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random graphs. John Wiley & Sons, Inc, Chichester (2000)"},{"key":"51_CR12","doi-asserted-by":"crossref","unstructured":"Korovin, K., Voronkov, A.: Random databases and threshold for monotone non-recursive datalog. Preprint, School of Computer Science, The University of Manchester (2005)","DOI":"10.1007\/11549345_51"},{"key":"51_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335168.335170","volume-title":"Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems","author":"R. Kumar","year":"2000","unstructured":"Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., Upfal, E.: The web as a graph. In: Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Dallas, Texas, USA, May 15-17, pp. 1\u201310. ACM, New York (2000)"},{"key":"51_CR14","volume-title":"Texts in Theoretical Computer Science","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. In: Texts in Theoretical Computer Science, Springer, Heidelberg (2004)"},{"issue":"2","key":"51_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(97)00091-1","volume":"190","author":"S. Lifschitz","year":"1998","unstructured":"Lifschitz, S., Vianu, V.: A probabilistic view of Datalog parallelization. Theoretical Computer Science\u00a0190(2), 211\u2013239 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"51_CR16","first-page":"97","volume":"1","author":"S. Shelah","year":"1988","unstructured":"Shelah, S., Spencer, J.: Zero one laws for sparse random graphs. Journal of the AMS\u00a01(1), 97\u2013115 (1988)","journal-title":"Journal of the AMS"},{"key":"51_CR17","volume-title":"Algorithms and Combinatorics","author":"J. Spencer","year":"2001","unstructured":"Spencer, J.: The Strange Logic of Random Graphs. In: Algorithms and Combinatorics, vol.\u00a022, Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:41:20Z","timestamp":1605642080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11549345_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}