{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:54Z","timestamp":1725664494914},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60922-9_35","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:04:24Z","timestamp":1330290264000},"page":"427-438","source":"Crossref","is-referenced-by-count":3,"title":["The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs"],"prefix":"10.1007","author":[{"given":"Jerzy","family":"Marcinkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0020-0190(89)90019-7","volume":"32","author":"S. Abiteboul","year":"1989","unstructured":"S. Abiteboul, Boundedness is Undecidable for Daialog Programs with a Single Recursive Rule, Information Processing Letters 32 (1989) pp. 281\u2013287.","journal-title":"Information Processing Letters"},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"M. Ajtai, Y. Gurevich, DATALOG versus First Order Logic, Proc. of 30th FOCS, 1989.","DOI":"10.1109\/SFCS.1989.63469"},{"key":"35_CR3","unstructured":"J.H. Conway, Unpredictable Iterations, Proceedings of 1972 Number Theory Conference, University of Colorado, pp. 49\u201352, 1972."},{"key":"35_CR4","first-page":"280","volume-title":"Proc. of 5th ACM PODS","author":"S.S. Cosmadakis","year":"1986","unstructured":"S.S. Cosmadakis, P. C. Kanellakis, Parallel evaluation of recursive rule queries, Proc. of 5th ACM PODS, ACM, New York, 1986, pp 280\u2013293."},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"S.S. Cosmadakis, H. Gaifman, P. C. Kanellakis, M.Y. Vardi, Decidable Optimization Problems for Database Logic Programs, Proceedings of 20th ACM STOC (1988) pp. 477\u2013490.","DOI":"10.1145\/62212.62259"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"P. Devienne, P. Leb\u00e8gue, J.C. Routier, Halting Problem of One Binary Recursive Horn Clause is Undecidable, Proc. of STACS'93, Springer 1993.","DOI":"10.1007\/3-540-56503-5_7"},{"key":"35_CR7","unstructured":"P. Devienne, P. Leb\u00e8gue, J.C. Routier, The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable, Proc. of ILPS'93, MIT 93."},{"issue":"no3","key":"35_CR8","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1145\/174130.174142","volume":"40","author":"H. Gaifman","year":"1993","unstructured":"H. Gaifman, H. G. Mairson, Y. Sagiv, M.Y. Vardi, Undecidable Optimization Problems for Database Logic Programs, Journal of the ACM, vol 40, no 3, July 1993, pp. 683\u2013713.","journal-title":"Journal of the ACM"},{"key":"35_CR9","first-page":"395","volume":"470","author":"I. Guessarian","year":"1990","unstructured":"I. Guessarian, Deciding Boundedness for Uniformly Connected Datalog Programs ICDT 1990, (Springer, LNCS 470, pp 395\u2013405).","journal-title":"Springer, LNCS"},{"key":"35_CR10","unstructured":"G.G. Hillebrand, P. C. Kanellakis, H. G. Mairson, M.Y. Vardi, Undecidable Boundedness Problems for Datalog Programs, Proc. of 10th PODS, 1991."},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis Elements of Relational Database Theory in Handbook of Theoretical Computer Science, vol B, J. van Leeuven ed. North-Holland 1990.","DOI":"10.1016\/B978-0-444-88074-1.50022-6"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis Logic Programming and Parallel Complexity, in: J. Minker ed., Foundations of Deductive Databases and Logic Programming (Morgan Kaufman 1988, pp 547\u2013586)","DOI":"10.1016\/B978-0-934613-40-8.50018-X"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"J.C. Lagarias, The 3x+1 problem and its generalizations, Amer. Math. Monthly 92, 1985.","DOI":"10.2307\/2322189"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Ke Wang, Some Positive Results for Boundedness of Multiple Recursive Rules, 95 International Conference on Database Theory, 1995","DOI":"10.1007\/3-540-58907-4_29"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"M.Y. Vardi, Decidability and undecidability results for boundedness of linear recursive queries, Proc. of 8th PODS, ACM 1988, pp 341\u2013351.","DOI":"10.1145\/308386.308470"},{"key":"35_CR16","unstructured":"Zeno of Elea, Achilles will never catch the Turtle, private comm. 467 BC."}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:35Z","timestamp":1605646955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}