{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T23:51:55Z","timestamp":1649202715656},"reference-count":20,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0020-0190(95)00097-v","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"279-282","source":"Crossref","is-referenced-by-count":0,"title":["A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs"],"prefix":"10.1016","volume":"55","author":[{"given":"H.","family":"Leung","sequence":"first","affiliation":[]},{"given":"D.","family":"Ranjan","sequence":"additional","affiliation":[]},{"given":"H.J.","family":"Hern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"D.","family":"Tang","sequence":"additional","affiliation":[]},{"given":"A.","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00097-V_BIB1","series-title":"Proc. 6th ACM Symp. on Principles of Programming Languages","first-page":"110","article-title":"University of data retrieval languages","author":"Aho","year":"1979"},{"key":"10.1016\/0020-0190(95)00097-V_BIB2","series-title":"Proc. 5th ACM Symp. on Principles of Database Systems","first-page":"280","article-title":"Parallel evaluation of recursive rule rule queries","author":"Cosmadakis","year":"1986"},{"key":"10.1016\/0020-0190(95)00097-V_BIB3","series-title":"Proc. 8th ACM Symp. on Principles of Programming languages","first-page":"50","article-title":"Programming primitives for database languages","author":"Chandra","year":"1981"},{"key":"10.1016\/0020-0190(95)00097-V_BIB4","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","article-title":"Computable queries for relational databases","volume":"21","author":"Chandra","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(95)00097-V_BIB5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and complexity of relational queries","volume":"25","author":"Chandra","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(95)00097-V_BIB6","series-title":"Proc. 13th Symp. on theory of computing","first-page":"342","article-title":"Embedded implicational dependencies and their inference problem","author":"Chandra","year":"1981"},{"key":"10.1016\/0020-0190(95)00097-V_BIB7","series-title":"Proc. 11th ACM Symp. on Principles of Database Systems","first-page":"55","article-title":"On the equivalence of recursive and nonrecursive Datalog programs","author":"Chaudhuri","year":"1992"},{"key":"10.1016\/0020-0190(95)00097-V_BIB8","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(51)90009-6","article-title":"Recursive queries and context-free graph grammars","volume":"78","author":"Courcelle","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(95)00097-V_BIB9","series-title":"Logic and Databases","year":"1978"},{"key":"10.1016\/0020-0190(95)00097-V_BIB10","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(95)00097-V_BIB11","article-title":"Elements of relational database theory","volume":"Vol. B","author":"Kanellakis","year":"1990"},{"key":"10.1016\/0020-0190(95)00097-V_BIB12","series-title":"Proc. 10th ACM Symp. on Principles of Database Systems","first-page":"259","article-title":"Overbound and right-linear queries","author":"Mumick","year":"1991"},{"key":"10.1016\/0020-0190(95)00097-V_BIB13","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/58562.59303","article-title":"Minimizing function-free recursive definitions","volume":"36","author":"Naughton","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(95)00097-V_BIB14","series-title":"Proc. ACM-SIGMOD Internat. Conf. on Manahement of Data","first-page":"235","article-title":"Efficient evaluation of right, left, and multilinear rules","author":"Naughton","year":"1989"},{"key":"10.1016\/0020-0190(95)00097-V_BIB15","series-title":"Proc. 8th ACM Symp. on Principles of Databases Systems","first-page":"1","article-title":"Proof-tree transformation theorems and their applications","author":"Ramakrishnan","year":"1989"},{"key":"10.1016\/0020-0190(95)00097-V_BIB16","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"659","article-title":"Optimizing Datalog programs","author":"Sagiv","year":"1988"},{"key":"10.1016\/0020-0190(95)00097-V_BIB17_1","volume":"Vol. 1","author":"Ullman","year":"1989"},{"key":"10.1016\/0020-0190(95)00097-V_BIB17_2","volume":"Vol. 2","author":"Ullman","year":"1989"},{"key":"10.1016\/0020-0190(95)00097-V_BIB18","series-title":"Proc. 14th ACM Symp. on Theory of Computing","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/0020-0190(95)00097-V_BIB19","article-title":"Query-by-Example: Operations on the transitive closure","author":"Zloof","year":"1976","journal-title":"IBM Research Rept. RC5526"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500097V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500097V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T22:58:20Z","timestamp":1555282700000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500097V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["002001909500097V"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00097-v","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}