{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:38:14Z","timestamp":1703187494360},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"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":8325,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1990,10]]},"DOI":"10.1016\/0022-0000(90)90035-j","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"157-180","source":"Crossref","is-referenced-by-count":7,"title":["Bounds on the propagation of selection into logic programs"],"prefix":"10.1016","volume":"41","author":[{"given":"Catriel","family":"Beeri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paris","family":"Kanellakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francois","family":"Bancilhon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghu","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90035-J_BIB1","series-title":"Proceedings, 6th PODS","first-page":"210","article-title":"The parallel complexity of simple chain queries","author":"Afrati","year":"1987"},{"key":"10.1016\/0022-0000(90)90035-J_BIB2","series-title":"Proceedings, 6th POPL","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979"},{"key":"10.1016\/0022-0000(90)90035-J_BIB3","series-title":"Proceedings, 29th FOCS","first-page":"358","article-title":"Reachability is harder for directed than for undirected graphs","author":"Ajtai","year":"1988"},{"issue":"No. 4","key":"10.1016\/0022-0000(90)90035-J_BIB4","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the theory of logic programming","volume":"29","author":"Apt","year":"1982","journal-title":"Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90035-J_BIB5","series-title":"Proceedings, 5th PODS","first-page":"1","article-title":"Magic sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0022-0000(90)90035-J_BIB6","series-title":"Proceedings, 86 Sigmod","first-page":"16","article-title":"An amateur's introduction to recursive query processing strategies","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0022-0000(90)90035-J_BIB7","series-title":"Proceedings, 6th PODS","first-page":"269","article-title":"On the power of magic","author":"Beeri","year":"1987"},{"issue":"No. 5","key":"10.1016\/0022-0000(90)90035-J_BIB8","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/S0022-0000(73)80002-9","article-title":"The unsolvability of the equality problem for sentential forms of context free grammars","volume":"7","author":"Blattner","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(90)90035-J_BIB9","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","article-title":"Weak second order arithmetic and finite automata","volume":"6","author":"Buchi","year":"1960","journal-title":"Z. Math. Logik"},{"key":"10.1016\/0022-0000(90)90035-J_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn clause programs and generalizations","volume":"2","author":"Chandra","year":"1985","journal-title":"J. Logic Programm."},{"issue":"No. 1","key":"10.1016\/0022-0000(90)90035-J_BIB11","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\/0022-0000(90)90035-J_BIB12","series-title":"Proceedings, 5th PODS","first-page":"280","article-title":"Parallel evaluation of recursive rule queries","author":"Cosmadakis","year":"1986"},{"key":"10.1016\/0022-0000(90)90035-J_BIB13","series-title":"Proceedings, 20th STOC","first-page":"477","article-title":"Decidable optimization problems for database logic programs","author":"Cosmadakis","year":"1988"},{"key":"10.1016\/0022-0000(90)90035-J_BIB14","series-title":"Proceedings, 16th STOC","first-page":"409","article-title":"Uniform definability of finite structures with successor","author":"Derougemont","year":"1984"},{"key":"10.1016\/0022-0000(90)90035-J_BIB15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","article-title":"Decision problems of finite automaton design and related arithmetics","volume":"98","author":"Elgot","year":"1961","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0022-0000(90)90035-J_BIB16","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/malq.19750210112","article-title":"Monadic generalized spectra","volume":"21","author":"Fagin","year":"1975","journal-title":"Z. Math. Logik"},{"key":"10.1016\/0022-0000(90)90035-J_BIB17","series-title":"Proceedings, 2nd LICS","first-page":"106","article-title":"Undecidable optimization problems for database logic programs","author":"Gaifman","year":"1987"},{"key":"10.1016\/0022-0000(90)90035-J_BIB18","first-page":"44","article-title":"A simple proof that connectivity of finite graphs is not first order definable","volume":"26","author":"Gaifman","year":"1985","journal-title":"Bulletin EATCS"},{"issue":"No. 1","key":"10.1016\/0022-0000(90)90035-J_BIB19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2422.2423","article-title":"On compiling queries in recursive first-order databases","volume":"31","author":"Henschen","year":"1984","journal-title":"Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(90)90035-J_BIB20","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0022-0000(90)90035-J_BIB21","series-title":"Elementary Induction on Abstract Structures","author":"Moschovakis","year":"1974"},{"key":"10.1016\/0022-0000(90)90035-J_BIB22","series-title":"Proceedings, 6th PODS","first-page":"340","article-title":"One-sided recursions","author":"Naughton","year":"1987"},{"key":"10.1016\/0022-0000(90)90035-J_BIB23","series-title":"Proceedings, 5th PODS","first-page":"16","article-title":"On the implementation of a simple class of logic queries for databases","author":"Sacca","year":"1986"},{"key":"10.1016\/0022-0000(90)90035-J_BIB24","series-title":"Proceedings, 6th PODS","first-page":"349","article-title":"Optimizing datalog programs","author":"Sagiv","year":"1987"},{"key":"10.1016\/0022-0000(90)90035-J_BIB25","series-title":"Proceedings, 6th PODS","first-page":"237","article-title":"Decidability and expressiveness aspects of logic queries","author":"Shmueli","year":"1987"},{"issue":"No. 1","key":"10.1016\/0022-0000(90)90035-J_BIB26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory with an application to a decision problem of second order logic","volume":"2","author":"Thatcher","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(90)90035-J_BIB27","series-title":"Principles of Database Systems","author":"Ullman","year":"1983"},{"key":"10.1016\/0022-0000(90)90035-J_BIB28","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/3979.3980","article-title":"Implementation of logical query languages for databases","volume":"10","author":"Ullman","year":"1985","journal-title":"ACM Trans. Database Systems"},{"issue":"No. 1","key":"10.1016\/0022-0000(90)90035-J_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"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090035J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090035J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:55:58Z","timestamp":1550307358000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090035J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["002200009090035J"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90035-j","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}