{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T17:12:09Z","timestamp":1756573929091},"reference-count":33,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3582,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0304-3975(02)00730-2","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T04:26:12Z","timestamp":1049516772000},"page":"199-226","source":"Crossref","is-referenced-by-count":21,"title":["Linearisability on datalog programs"],"prefix":"10.1016","volume":"308","author":[{"given":"Foto","family":"Afrati","sequence":"first","affiliation":[]},{"given":"Manolis","family":"Gergatsoulis","sequence":"additional","affiliation":[]},{"given":"Francesca","family":"Toni","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00730-2_BIB1","doi-asserted-by":"crossref","unstructured":"F. Afrati, S. Cosmadakis. Expressiveness of restricted recursive queries, in: Proc. 21st ACM Symp. on Theory of Computing, ACM Press, New York, 1989, pp. 113\u2013126.","DOI":"10.1145\/73007.73018"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB2","series-title":"Perspectives of Systems Informatics (PSI\u201996), Proceedings","first-page":"433","article-title":"On transformations into linear database logic programs","volume":"Vol. 1181","author":"Afrati","year":"1996"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB3","doi-asserted-by":"crossref","unstructured":"F. Afrati, C.H. Papadimitriou, The parallel complexity of simple chain queries, in: Proc. 6th ACM Symp. on Principles of Database Systems, ACM Press, New York, 1987, pp. 210\u2013213.","DOI":"10.1145\/28659.28682"},{"issue":"3","key":"10.1016\/S0304-3975(02)00730-2_BIB4","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1145\/153724.153752","article-title":"Parallel complexity of simple logic programs","volume":"40","author":"Afrati","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB5","unstructured":"F. Afrati, F. Toni, Chain queries expressible by linear datalog programs, in: U. Geske, C. Ruiz, D. Seipel (Eds.), Proc. 5th Internat. Workshop on Deductive Databases and Logic Programming (DDLP\u201997), GMD-studien No. 317, Sankt Augustin, 1997, pp. 49\u201358."},{"key":"10.1016\/S0304-3975(02)00730-2_BIB6","doi-asserted-by":"crossref","unstructured":"F. Bancilhon, R. Ramakrishnan, An amateur's introduction to recursive query processing strategies, in: Proc. ACM Conf. on Management of Data, Washington, DC, ACM Press, 1986, pp. 16\u201352.","DOI":"10.1145\/16894.16859"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB7","doi-asserted-by":"crossref","unstructured":"C. Beeri, P.C. Kanellakis, F. Bancilhon, R. Ramakrishnan, Bounds on the propagation of selection into logic programs, in: Proc. 6th ACM Symp. on Principles of Database Systems, ACM Press, New York, 1987, pp. 214\u2013226.","DOI":"10.1145\/28659.28683"},{"issue":"1,2","key":"10.1016\/S0304-3975(02)00730-2_BIB8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0743-1066(93)90023-A","article-title":"Basic transformation operations which preserve computed answer substitutions of logic programs","volume":"16","author":"Bossi","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB9","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(74)80046-2","article-title":"An observation on time-storage trade off","volume":"9","author":"Cook","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00730-2_BIB10","doi-asserted-by":"crossref","unstructured":"S.S. Cosmadakis, H. Gaifman, P.C. Kanellakis, M.Y. Vardi, Decidable optimization problems for database logic programs, in: Proc. 20th ACM Symp. on Theory of Computing, ACM Press, New York, 1988, pp. 477\u2013490.","DOI":"10.1145\/62212.62259"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB11","doi-asserted-by":"crossref","unstructured":"S.S. Cosmadakis, P.C. Kanellakis, Parallel evaluation of recursive rule queries, in: Proc. 5th ACM Symp. on Principles of Database Systems, ACM Press, New York, 1986, pp. 280\u2013293.","DOI":"10.1145\/6012.15421"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB12","doi-asserted-by":"crossref","unstructured":"M. Gergatsoulis, Logic program transformations: transformation rules and application strategies, Ph.D. Thesis, Department of Computer Science, University of Athens, 1994 (in Greek).","DOI":"10.1007\/3-540-58402-1_24"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB13","series-title":"Programming Language Implementation and Logic Programming (PLILP\u201994), Proceedings","first-page":"340","article-title":"Unfold\/fold transformations for definite clause programs","volume":"Vol. 844","author":"Gergatsoulis","year":"1994"},{"issue":"2","key":"10.1016\/S0304-3975(02)00730-2_BIB14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/103516.103521","article-title":"Towards an algebraic theory of recursion","volume":"38","author":"Ioannidis","year":"1991","journal-title":"J. ACM."},{"key":"10.1016\/S0304-3975(02)00730-2_BIB15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0304-3975(90)90065-P","article-title":"Preservation of stronger equivalence in unfold\/fold logic program transformations","volume":"75","author":"Kawamura","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00730-2_BIB16","doi-asserted-by":"crossref","unstructured":"J.-L. Lasser, M.J. Maher, K. Marriott, Unification revisited, in: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann Publishers, Inc., Los Altos, CA, 1988, pp. 587\u2013625.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB17","doi-asserted-by":"crossref","unstructured":"J.F. Naughton, Data independent recursion in deductive databases, in: Proc. 5th ACM Symp. on Principles of Database Systems, ACM Press, New York, 1986, pp. 267\u2013279.","DOI":"10.1145\/6012.15420"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB18","doi-asserted-by":"crossref","unstructured":"J.F. Naughton, Y. Sagiv, A decidable class of bounded recursions, in: Proc. 6th ACM Symp. on Principles of Database Systems, ACM Press, New York, 1987, pp. 227\u2013236.","DOI":"10.1145\/28659.28684"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB19","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB20","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","article-title":"Transformation of logic programs","volume":"19\/20","author":"Pettorossi","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB21","doi-asserted-by":"crossref","unstructured":"M. Proietti, A. Pettorossi, Synthesis of Eureka predicates for developing logic programs, in: Proc. 3rd European Symp. on Programming, Lecture Notes in Computer Science (LNCS), Vol. 432, Springer, Berlin, 1990, pp. 306\u2013325.","DOI":"10.1007\/3-540-52592-0_71"},{"issue":"1,2","key":"10.1016\/S0304-3975(02)00730-2_BIB22","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0743-1066(93)90025-C","article-title":"The loop absorption and the generalization strategies for the development of logic programs and partial deduction","volume":"16","author":"Proietti","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB23","doi-asserted-by":"crossref","unstructured":"Y.P. Saraiya, Linearising non-linear recursion in polynomial time, in: Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, ACM Press, New York, 1990, pp. 182\u2013189.","DOI":"10.1145\/73721.73740"},{"issue":"1","key":"10.1016\/S0304-3975(02)00730-2_BIB24","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1006\/jcss.1995.1054","article-title":"On the efficiency of transforming database logic programs","volume":"51","author":"Saraiya","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00730-2_BIB25","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(91)90007-O","article-title":"Unfold\/fold transformation of stratified programs","volume":"86","author":"Seki","year":"1991","journal-title":"Theoret. Comput. Sci."},{"issue":"1,2","key":"10.1016\/S0304-3975(02)00730-2_BIB26","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0743-1066(93)90021-8","article-title":"Unfold\/fold transformations for general logic programs for the well-founded semantics","volume":"16","author":"Seki","year":"1993","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB27","unstructured":"H. Tamaki, T. Sato, Unfold\/fold transformations of logic programs, in: Sten-\u00c5ke Tarnlund (Ed.), Proc. 2nd Internat. Conf. on Logic Programming, Uppsala, Sweden, 1984, pp. 127\u2013138."},{"key":"10.1016\/S0304-3975(02)00730-2_BIB28","unstructured":"H. Tamaki, T. Sato, A generalized correctness proof of the unfold\/fold logic program transformation, Tech. Report No 86-4, Department of Information Science, Ibaraki University, Japan, 1986."},{"key":"10.1016\/S0304-3975(02)00730-2_BIB29","unstructured":"J.D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. I, II, Computer Science Press, Rockville, MD, 1989."},{"key":"10.1016\/S0304-3975(02)00730-2_BIB30","doi-asserted-by":"crossref","unstructured":"J.D. Ullman, A. Van Gelder, Parallel complexity of logical query programs, in: Proc. 27th IEEE Symp. on Foundations of Computer Science, Toronto, Ontario, 1986, pp. 438\u2013454.","DOI":"10.1109\/SFCS.1986.40"},{"issue":"4","key":"10.1016\/S0304-3975(02)00730-2_BIB31","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"23","author":"van Emden","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00730-2_BIB32","doi-asserted-by":"crossref","unstructured":"M.Y. Vardi, Decidability and undecidability results for boundedness of linear recursive queries, in: Proc. 7th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, ACM Press, New York, 1988, pp. 341\u2013351.","DOI":"10.1145\/308386.308470"},{"issue":"3","key":"10.1016\/S0304-3975(02)00730-2_BIB33","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1145\/88636.89237","article-title":"A necessary and sufficient condition to linearise doubly recursive programs in logic databases","volume":"15","author":"Zang","year":"1990","journal-title":"ACM Trans. Database Systems"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502007302?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502007302?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T10:43:36Z","timestamp":1584528216000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502007302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":33,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0304397502007302"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00730-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}