{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:20Z","timestamp":1749124040240},"reference-count":40,"publisher":"Elsevier BV","issue":"4","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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[1990,10]]},"DOI":"10.1016\/0169-023x(90)90017-8","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T17:15:20Z","timestamp":1047662120000},"page":"289-312","source":"Crossref","is-referenced-by-count":59,"title":["Query evaluation in recursive databases: bottom-up and top-down reconciled"],"prefix":"10.1016","volume":"5","author":[{"given":"Fran\u00e7ois","family":"Bry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-023X(90)90017-8_BIB1","series-title":"Foundations of Deductive Databases and Logic Programming","author":"Apt","year":"1988"},{"key":"10.1016\/0169-023X(90)90017-8_BIB2","series-title":"Proc. 5th ACM SIGMODSIGACT Symp. Principles of Database Systems (PODS)","article-title":"Magic sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0169-023X(90)90017-8_BIB3","series-title":"Proc. ACM-SIGMOD Conf. Management of Data (SIGMOD)","article-title":"An amateur's introduction to recursive query processing strategies","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0169-023X(90)90017-8_BIB4","series-title":"Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS)","article-title":"Recursive query processing","author":"Beeri","year":"1989"},{"key":"10.1016\/0169-023X(90)90017-8_BIB5","series-title":"Proc. 6th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS)","article-title":"On the power of magic","author":"Beeri","year":"1987"},{"key":"10.1016\/0169-023X(90)90017-8_BIB6","series-title":"Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS)","article-title":"Logic programming as constructivism: A formalization and its application to databases","author":"Bry","year":"1989"},{"key":"10.1016\/0169-023X(90)90017-8_BIB7","series-title":"Proc. 1st Int. Conf. Deductive and Object-Oriented Databases (DOOD)","article-title":"Query evaluation in recursive database: Bottom-up and top-down reconciled","author":"Bry","year":"1989"},{"key":"10.1016\/0169-023X(90)90017-8_BIB8","article-title":"Upside-down deduction","author":"Bry","year":"1989"},{"key":"10.1016\/0169-023X(90)90017-8_BIB9","series-title":"6th Int. Conf. Logic Programming (ICLP)","article-title":"Deductive Databases","author":"Bry","year":"1989"},{"key":"10.1016\/0169-023X(90)90017-8_BIB10","article-title":"Evaluation strategies for recursive axioms: A uniform presentation","author":"Demolombe","year":"1986"},{"key":"10.1016\/0169-023X(90)90017-8_BIB11","series-title":"Proc. Symp. Logic Programming (SLP)","article-title":"Extension tables: Memo relations in logic programming","author":"Dietrich","year":"1987"},{"key":"10.1016\/0169-023X(90)90017-8_BIB12","doi-asserted-by":"crossref","DOI":"10.1007\/BF03037136","article-title":"Specialisation of Prolog and FCP programs using abstract interpretation","volume":"6","author":"Gallagher","year":"1988","journal-title":"New Generation Comput."},{"key":"10.1016\/0169-023X(90)90017-8_BIB13","article-title":"LUSH-Resolution and its completeness","volume":"78","author":"Hill","year":"1974"},{"key":"10.1016\/0169-023X(90)90017-8_BIB14","series-title":"Proc. Workshop Meta-Programming in Logic Programming","article-title":"Analysis of meta-programs","author":"Hill","year":"1988"},{"key":"10.1016\/0169-023X(90)90017-8_BIB15","article-title":"Algorithm=Logic+Control","author":"Kowalski","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/0169-023X(90)90017-8_BIB16","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(71)90012-9","article-title":"Linear resolution with selection function","volume":"2","author":"Kowalski","year":"1971","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0169-023X(90)90017-8_BIB17","series-title":"Proc. 1st Int. Conf. Deductive and Object-Oriented Databases (DOOD)","article-title":"In deductive query evaluation in the Dedgin\u2217 system","author":"Lefebvre","year":"1989"},{"key":"10.1016\/0169-023X(90)90017-8_BIB18","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0169-023X(90)90017-8_BIB19","series-title":"Proc. IRIA Symp. Automatic Demonstration","article-title":"A linear format for resolution","volume":"125","author":"Loveland","year":"1970"},{"key":"10.1016\/0169-023X(90)90017-8_BIB20","series-title":"Proc. IRIA Symp. Automatic Demonstration","article-title":"Refinements theorems in resolution theory","volume":"125","author":"Luckham","year":"1970"},{"key":"10.1016\/0169-023X(90)90017-8_BIB21","series-title":"Proc. 9th Int. Conf. Automated Deduction (CADE)","article-title":"SATCHMO: A theorem prover implemented in Prolog","author":"Manthey","year":"1988"},{"key":"10.1016\/0169-023X(90)90017-8_BIB22","series-title":"Proc. 13th Int. Conf. Very Large Data Bases (VLDB)","article-title":"Recursive strategies for answering recursive queries-The RQA\/FQI strategy","author":"Nejdl","year":"1987"},{"key":"10.1016\/0169-023X(90)90017-8_BIB23","series-title":"Proc. 5th Int. Conf. Symp. on Logic Programming (ICLP\/S:P)","article-title":"Magic templates: A spellbinding approach to logic programs","author":"Ramakrishnan","year":"1988"},{"issue":"3","key":"10.1016\/0169-023X(90)90017-8_BIB24","doi-asserted-by":"crossref","DOI":"10.1007\/BF03037407","article-title":"The Alexander method, A technique for the processing of recursive axioms in deductive databases","volume":"4","author":"Rohmer","year":"1986","journal-title":"New Generation Comput."},{"key":"10.1016\/0169-023X(90)90017-8_BIB25","series-title":"Proc. Symp. Logic Programming (SLP)","article-title":"Compiling exploratory and goal-directed deduction into sloppy delta-iteration","author":"Schmidt","year":"1987"},{"key":"10.1016\/0169-023X(90)90017-8_BIB26","series-title":"Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS)","article-title":"On the power of Alexander templates","author":"Seki","year":"1989"},{"issue":"2","key":"10.1016\/0169-023X(90)90017-8_BIB27","doi-asserted-by":"crossref","DOI":"10.1145\/43908.43910","article-title":"A bibliography on partial evaluation","volume":"23","author":"Sestoft","year":"1987","journal-title":"SIGPLAN Notices"},{"key":"10.1016\/0169-023X(90)90017-8_BIB28","series-title":"The Art of Prolog","author":"Sterling","year":"1986"},{"key":"10.1016\/0169-023X(90)90017-8_BIB29","series-title":"Proc. Workshop Meta-Programming in Logic Programming","article-title":"Foundations of metalogic programming","author":"Subrahmanian","year":"1988"},{"key":"10.1016\/0169-023X(90)90017-8_BIB30","series-title":"Proc. 3rd Int. Conf. Logic Programming (ICLP)","article-title":"OLD resolution with tabulation","author":"Tamaki","year":"1986"},{"key":"10.1016\/0169-023X(90)90017-8_BIB31","doi-asserted-by":"crossref","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"issue":"3","key":"10.1016\/0169-023X(90)90017-8_BIB32","doi-asserted-by":"crossref","DOI":"10.1145\/3979.3980","article-title":"Implementation of logical query language for databases","volume":"10","author":"Ullman","year":"1985","journal-title":"Trans. Database Systems"},{"key":"10.1016\/0169-023X(90)90017-8_BIB33","series-title":"Proc. 8th ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (PODS)","article-title":"Bottom-up beats top-down for Datalog","author":"Ullman","year":"1989"},{"issue":"4","key":"10.1016\/0169-023X(90)90017-8_BIB34","doi-asserted-by":"crossref","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\/0169-023X(90)90017-8_BIB35","series-title":"Foundations of deductive databases and logic programming","author":"Van Gelder","year":"1988"},{"key":"10.1016\/0169-023X(90)90017-8_BIB36","series-title":"Proc. 1st Int. Conf. Expert Database System (EDS)","article-title":"Recursive axioms in deductive databases: The Query-Subquery approach","author":"Vieille","year":"1986"},{"key":"10.1016\/0169-023X(90)90017-8_BIB37","series-title":"Proc. 4th Int. Conf. Logic Programming (ICLP)","article-title":"A database-complete proof procedure based on SLD-resolution","author":"Vieille","year":"1987"},{"issue":"1","key":"10.1016\/0169-023X(90)90017-8_BIB38","article-title":"Recursive query processing: The power of logic","volume":"69","author":"Vieille","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0169-023X(90)90017-8_BIB39","series-title":"Proc. 1. Workshop Informationssysteme und K\u00fcnstliche Intelligenz","article-title":"Negation in logischer Programmierung: Eine Formalisierung in konstruktiver Logik","author":"Bry","year":"1990"},{"key":"10.1016\/0169-023X(90)90017-8_BIB40","series-title":"Proc. 7th Internat. Conf. Logic Programming (ICLP)","article-title":"Intensional updates: Abduction via deduction","author":"Bry","year":"1990"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X90900178?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X90900178?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T23:36:18Z","timestamp":1584488178000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169023X90900178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["0169023X90900178"],"URL":"https:\/\/doi.org\/10.1016\/0169-023x(90)90017-8","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}