{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:19:12Z","timestamp":1703186352001},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6591,"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":[[1995,7]]},"DOI":"10.1016\/0304-3975(94)00186-m","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"269-310","source":"Crossref","is-referenced-by-count":6,"title":["Argument reduction by factoring"],"prefix":"10.1016","volume":"146","author":[{"given":"J.F.","family":"Naughton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Ramakrishnana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Sagiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.D.","family":"Ullman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0304-3975(94)00186-M_bib1","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0208017","article-title":"Equivalence of relational expressions","volume":"8","author":"Aho","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)00186-M_bib2","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"1","article-title":"Magic sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0304-3975(94)00186-M_bib3","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"269","article-title":"On the power of magic","author":"Beeri","year":"1987"},{"key":"10.1016\/0304-3975(94)00186-M_bib4","series-title":"Conf. Record of the 9th Ann. ACM Symp. on Theory of Computing","first-page":"77","article-title":"Optimal implementation of conjunctive queries n relational data bases","author":"Chandra","year":"1977"},{"key":"10.1016\/0304-3975(94)00186-M_bib5","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/0304-3975(94)00186-M_bib6","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"340","article-title":"One sided recursions","author":"Naughton","year":"1987"},{"key":"10.1016\/0304-3975(94)00186-M_bib7","series-title":"Proc. SIGMOD Internat. Symp. on Management of Data","first-page":"312","article-title":"Compiling separable recursions","author":"Naughton","year":"1988"},{"key":"10.1016\/0304-3975(94)00186-M_bib8","doi-asserted-by":"crossref","DOI":"10.1145\/50202.50240","article-title":"Compiling separable recursions","author":"Naughton","year":"1988"},{"key":"10.1016\/0304-3975(94)00186-M_bib9","series-title":"Proc. ACM SIGMOD Internat. Conf. on Management of Data","first-page":"235","article-title":"Efficient evaluation of right-, left-, and multi-linear rules","author":"Naughton","year":"1989"},{"key":"10.1016\/0304-3975(94)00186-M_bib10","series-title":"Proc. Internat. Conf. on Logic Programming","first-page":"140","article-title":"Magic templates: A spellbinding approach to logic programs","author":"Ramakrishnan","year":"1988"},{"key":"10.1016\/0304-3975(94)00186-M_bib11","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"89","article-title":"Optimizing existential datalog queries","author":"Ramakrishnan","year":"1988"},{"key":"10.1016\/0304-3975(94)00186-M_bib12","series-title":"Proc. 1st Internat. Conf. on Database Theory","article-title":"The generalized counting methods for recursive logic queries","author":"Sacca","year":"1986"},{"key":"10.1016\/0304-3975(94)00186-M_bib13","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"659","article-title":"Optimizing datalog programs","author":"Sagiv","year":"1988"},{"key":"10.1016\/0304-3975(94)00186-M_bib14","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"237","article-title":"Decidability and expressiveness aspects of logic queries","author":"Shmueli","year":"1987"},{"issue":"4","key":"10.1016\/0304-3975(94)00186-M_bib15","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"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400186M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400186M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:28:18Z","timestamp":1555417698000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400186M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759400186M"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00186-m","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}