{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T14:47:39Z","timestamp":1749221259499},"reference-count":30,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":6623,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1016\/0743-1066(94)00027-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:44:48Z","timestamp":1027629888000},"page":"203-236","source":"Crossref","is-referenced-by-count":6,"title":["On decompositions of chain datalog programs into P (left-)linear 1-rule components"],"prefix":"10.1016","volume":"23","author":[{"given":"Guozhu","family":"Dong","sequence":"first","affiliation":[]},{"given":"Seymour","family":"Ginsburg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(94)00027-4_BIB1","series-title":"Proc. ACM SIGACT Symp. on the Theory of Computing","first-page":"113","article-title":"Expressiveness of restricted recursive queries","author":"Afrati","year":"1989"},{"key":"10.1016\/0743-1066(94)00027-4_BIB2","series-title":"Proc. ACM Symposium on Principles of Database Systems","first-page":"210","article-title":"The parallel complexity of simple chain queries","author":"Afrati","year":"1987"},{"key":"10.1016\/0743-1066(94)00027-4_BIB3","series-title":"Proc. ACM Symposium on Principles of Database Systems","first-page":"214","article-title":"Bounds on the propagation of selection into logic programs","author":"Beeri","year":"1987"},{"key":"10.1016\/0743-1066(94)00027-4_BIB4","series-title":"Proc. of 1988 ICDT","first-page":"87","article-title":"On the composition and decomposition of datalog program mappings","author":"Dong","year":"1988"},{"key":"10.1016\/0743-1066(94)00027-4_BIB5","series-title":"Proc. ACM SIGMOD International Conference on Management of Data","first-page":"26","article-title":"On distributed processibility of datalog queries by decomposing databases","author":"Dong","year":"1989"},{"key":"10.1016\/0743-1066(94)00027-4_BIB6","series-title":"Theoretical Studies in Computer Science","first-page":"181","article-title":"On datalog linearization of chain queries","author":"Dong","year":"1991"},{"issue":"1","key":"10.1016\/0743-1066(94)00027-4_BIB7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(90)90015-A","article-title":"On the decomposition of datalog program mappings","volume":"76","author":"Dong","year":"1990","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(94)00027-4_BIB8","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/321127.321132","article-title":"Two families of languages related to ALGOL","volume":"9","author":"Ginsburg","year":"1962","journal-title":"Journal of ACM"},{"key":"10.1016\/0743-1066(94)00027-4_BIB9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/321150.321153","article-title":"Some recursively unsolvable problems in ALGOL-like languages","volume":"10","author":"Ginsburg","year":"1963","journal-title":"JACM"},{"key":"10.1016\/0743-1066(94)00027-4_BIB10","first-page":"333","article-title":"Bounded ALGOL-like languages","volume":"113","author":"Ginsburg","year":"1964","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0743-1066(94)00027-4_BIB11","first-page":"1043","article-title":"Bounded regular sets","volume":"17","author":"Ginsburg","year":"1966"},{"key":"10.1016\/0743-1066(94)00027-4_BIB12","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/0743-1066(94)00027-4_BIB13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0019-9958(82)91028-2","article-title":"Regular languages of star height one","volume":"53","author":"Hashiguchi","year":"1982","journal-title":"Information and Control"},{"issue":"1","key":"10.1016\/0743-1066(94)00027-4_BIB14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0207007","article-title":"Computational parallels between the regular and context-free languages","volume":"7","author":"Hunt","year":"1978","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0743-1066(94)00027-4_BIB15","series-title":"Proc. of Second International Conference on Expert Database Systems","first-page":"187","article-title":"Transforming nonlinear recursion to linear recursion","author":"Ioannidis","year":"1988"},{"key":"10.1016\/0743-1066(94)00027-4_BIB16","series-title":"Elements of the Theory of Computation","author":"Lewis","year":"1981"},{"key":"10.1016\/0743-1066(94)00027-4_BIB17","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(94)00027-4_BIB18","series-title":"Proc. ACM Symposium on Principles of Database Systems","first-page":"340","article-title":"One-sided recursions","author":"Naughton","year":"1987"},{"key":"10.1016\/0743-1066(94)00027-4_BIB19","series-title":"Proc. ACM SIGMOD International Conference on Management of Data","first-page":"312","article-title":"Compiling separable recursions","author":"Naughton","year":"1988"},{"key":"10.1016\/0743-1066(94)00027-4_BIB20","series-title":"Proc. International Conference on Very Large Databases","first-page":"173","article-title":"Argument reduction by factoring","author":"Naughton","year":"1989"},{"key":"10.1016\/0743-1066(94)00027-4_BIB21","series-title":"Proc. ACM Symposium on Principles of Database Systems","first-page":"145","article-title":"Semigroup techniques in recursive query optimization","author":"Plambeck","year":"1990"},{"key":"10.1016\/0743-1066(94)00027-4_BIB22","series-title":"Proc. ACM Symposium on Principles of Database Systems","first-page":"172","article-title":"Proof-tree transformation theorems and their applications","author":"Ramakrishnan","year":"1989"},{"key":"10.1016\/0743-1066(94)00027-4_BIB23","series-title":"Proc. ACM Symposium on Principles of Database Systems","first-page":"182","article-title":"Linearizing nonlinear recursions in polynomial time","author":"Saraiya","year":"1989"},{"key":"10.1016\/0743-1066(94)00027-4_BIB24","series-title":"Proc. ACM SIGMOD International Conf. on Management of Data","first-page":"64","article-title":"Hard problems for simple logic programs","author":"Saraiya","year":"1990"},{"key":"10.1016\/0743-1066(94)00027-4_BIB25","series-title":"Proc. ACM Symposium on Principles of Database Systems","first-page":"132","article-title":"Polynomial-time program transformations in deductive databases","author":"Saraiya","year":"1990"},{"key":"10.1016\/0743-1066(94)00027-4_BIB26","series-title":"Proc. ACM Symposium on Principles of Database Systems","first-page":"237","article-title":"Decidability and expressiveness aspects of logic queries","author":"Shmueli","year":"1987"},{"key":"10.1016\/0743-1066(94)00027-4_BIB27","volume":"Vol. I","author":"Ullman","year":"1988"},{"key":"10.1016\/0743-1066(94)00027-4_BIB28","volume":"Vol. II","author":"Ullman","year":"1989"},{"key":"10.1016\/0743-1066(94)00027-4_BIB29","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF01762108","article-title":"Parallel complexity of logical query programs","volume":"3","author":"Ullman","year":"1988","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/0743-1066(94)00027-4_BIB30","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1145\/88636.89237","article-title":"Necessary and sufficient conditions to linearize doubly recursive programs in logic databases","volume":"15","author":"Zhang","year":"1990","journal-title":"ACM Transactions on Database Systems"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694000274?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694000274?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T10:21:23Z","timestamp":1555410083000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106694000274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["0743106694000274"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(94)00027-4","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}