{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T12:39:30Z","timestamp":1778675970830,"version":"3.51.4"},"reference-count":63,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"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":8629,"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":[[1989,12]]},"DOI":"10.1016\/0304-3975(89)90088-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"1-53","source":"Crossref","is-referenced-by-count":94,"title":["Recursive query processing: the power of logic"],"prefix":"10.1016","volume":"69","author":[{"given":"Laurent","family":"Vielle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90088-1_BIB1","article-title":"University of data retrieval languages","author":"Aho","year":"1979","journal-title":"Proc. ACM Conference on the Principles of Programming Languages"},{"key":"10.1016\/0304-3975(89)90088-1_BIB2","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0208017","article-title":"Equivalences among relational expressions","volume":"8","author":"Aho","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90088-1_BIB3","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":"J. ACM"},{"key":"10.1016\/0304-3975(89)90088-1_BIB4","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/16856.16859","article-title":"An amateur's introduction to recursive query processing strategies","author":"Bancilhon","year":"1986","journal-title":"Proc. ACM Conf. on the Management of Data (SIGMOD)"},{"key":"10.1016\/0304-3975(89)90088-1_BIB5","first-page":"1","article-title":"Magic sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986","journal-title":"Proc. ACM Conf. on the Principles of Database Systens"},{"key":"10.1016\/0304-3975(89)90088-1_BIB6","first-page":"214","article-title":"Bounds on the propagation of selections into logic programs","author":"Bancilhon","year":"1987","journal-title":"Proc. 6th ACM Symp. on the Principles of Database Systems (PODS)"},{"key":"10.1016\/0304-3975(89)90088-1_BIB7","series-title":"Tech. Report","article-title":"Query evaluation and recursion in deductive database systems","author":"Bayer","year":"1985"},{"key":"10.1016\/0304-3975(89)90088-1_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1145\/28659.28689","article-title":"On the power of magic","author":"Beeri","year":"1987","journal-title":"Proc. 6th ACM Symp. on the Principles of Database Systems (PODS)"},{"key":"10.1016\/0304-3975(89)90088-1_BIB9","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\/0304-3975(89)90088-1_BIB10","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/0304-3975(89)90088-1_BIB11","first-page":"235","article-title":"On the evaluation of queries containing derived relations in a relational database","volume":"Vol 1","author":"Chang","year":"1981"},{"key":"10.1016\/0304-3975(89)90088-1_BIB12_1","series-title":"Research report 79\/59","article-title":"Predicate logic as a computational formalism","author":"Clark","year":"1979"},{"key":"10.1016\/0304-3975(89)90088-1_BIB12_2","series-title":"Foundations of Logic Programming","author":"Llyod","year":"1984"},{"key":"10.1016\/0304-3975(89)90088-1_BIB13","series-title":"Proc. Conf. on Very Large Database Systems (VLDB)","first-page":"197","article-title":"Of nests and trees: a unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers","author":"Dayal","year":"1987"},{"key":"10.1016\/0304-3975(89)90088-1_BIB14","series-title":"Tech. Report","article-title":"Evaluation strategies for recursive axioms: a uniform presentation","author":"Demolombe","year":"1986"},{"key":"10.1016\/0304-3975(89)90088-1_BIB15","first-page":"264","article-title":"Extension tables: meno relations in logic programming","author":"Dietrich","year":"1987","journal-title":"Proc. Symp. on Logic Programming"},{"key":"10.1016\/0304-3975(89)90088-1_BIB16","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1145\/362007.362035","article-title":"An efficient context-free parsing algorithm","volume":"13","author":"Earley","year":"1970","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(89)90088-1_BIB17","doi-asserted-by":"crossref","DOI":"10.1145\/356924.356929","article-title":"Logic and databases: a deductive approach","volume":"16","author":"Gallaire","year":"1984","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0304-3975(89)90088-1_BIB18","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/3149.214118","article-title":"On the efficiency of subsumption algorithms","volume":"32","author":"Gottlob","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(89)90088-1_BIB19","article-title":"Some performance results for query processing in relational database systems","author":"Han","year":"1986","journal-title":"Proc. IEEE Conf. on Data Engineering"},{"key":"10.1016\/0304-3975(89)90088-1_BIB20","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":"J. ACM"},{"key":"10.1016\/0304-3975(89)90088-1_BIB21","first-page":"759","article-title":"Domains in logic programming","author":"Van Hentenryck","year":"1986","journal-title":"Proc. AAAI National Conference on Artificial Intelligence"},{"key":"10.1016\/0304-3975(89)90088-1_BIB22_1","series-title":"DCL memo 78","article-title":"LUSH-resolution and its completeness","author":"Hill","year":"1974"},{"key":"10.1016\/0304-3975(89)90088-1_BIB22_2","series-title":"Foundations of logic Programming","author":"Llyod","year":"1984"},{"key":"10.1016\/0304-3975(89)90088-1_BIB23","series-title":"Tech. Report","article-title":"An efficient interpretive algorithm for recursive queries","author":"Hulin","year":"1987"},{"key":"10.1016\/0304-3975(89)90088-1_BIB24","first-page":"147","article-title":"Relational queries computable in polynomial time","author":"Immerman","year":"1982","journal-title":"Proc. ACM Symp. on Automata and Computability Theory (SIGACT)"},{"key":"10.1016\/0304-3975(89)90088-1_BIB25","first-page":"403","article-title":"On the computation of the transitive closure of relational operators","author":"Ioannidis","year":"1986","journal-title":"Proc. Conference on Very Large Data Bases (VLDB)"},{"key":"10.1016\/0304-3975(89)90088-1_BIB26","first-page":"178","article-title":"Completeness of a top-down query evaluation procedure for stratified databases","author":"Kemp","year":"1988","journal-title":"Proc. 5th Int. Conf. and Symp. on Logic Programming"},{"key":"10.1016\/0304-3975(89)90088-1_BIB27","series-title":"Preuve de la m\u00e9thode d'Alexandre par une approche alg\u00e9brique","author":"Kerisit","year":"1986"},{"key":"10.1016\/0304-3975(89)90088-1_BIB28","series-title":"Technical Report 87004","first-page":"55","article-title":"A relational approach to logic programming: the extended Alexander method","author":"Kerisit","year":"1987"},{"key":"10.1016\/0304-3975(89)90088-1_BIB29","series-title":"Tech. Report 86\/16","article-title":"Can we implement logic as a database system","author":"Kifer","year":"1986"},{"key":"10.1016\/0304-3975(89)90088-1_BIB30","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative deepening: an optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(89)90088-1_BIB31","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1145\/359131.359136","article-title":"Algorithm = logic+control","volume":"22","author":"Kowalski","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(89)90088-1_BIB32","doi-asserted-by":"crossref","first-page":"227","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\/0304-3975(89)90088-1_BIB33","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/B978-1-4832-1313-2.50036-6","article-title":"Datalog automata","author":"Lang","year":"1988","journal-title":"Proc. 3rd Int. Conf. on Data and Knowledge Bases"},{"key":"10.1016\/0304-3975(89)90088-1_BIB34","article-title":"Complete evaluation of Horn clauses: an automata theoretic approach","author":"Lang","year":"1988","journal-title":"Tech. Report"},{"key":"10.1016\/0304-3975(89)90088-1_BIB35","series-title":"Tech. Report","article-title":"An outline of DedGin\u2217: a recursive query evaluator","author":"Lefebvre","year":"1988"},{"key":"10.1016\/0304-3975(89)90088-1_BIB36","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/0304-3975(89)90088-1_BIB37","series-title":"Automated Theorem Proving: A Logical Basis","author":"Loveland","year":"1978"},{"key":"10.1016\/0304-3975(89)90088-1_BIB38","first-page":"173","article-title":"Evaluating queries in deductive databases by generating","author":"Lozinskii","year":"1985","journal-title":"Proc. Int. Joint Conf. on Artificial Intelligence"},{"key":"10.1016\/0304-3975(89)90088-1_BIB39","series-title":"Introduction to Mathematical Logic","author":"Mendelson","year":"1979"},{"key":"10.1016\/0304-3975(89)90088-1_BIB40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0306-4379(83)90024-8","article-title":"On recursive axioms in deductive databases","volume":"8","author":"Minker","year":"1983","journal-title":"Inform. Systems"},{"key":"10.1016\/0304-3975(89)90088-1_BIB41","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0743-1066(85)90017-2","article-title":"Automatic control for logic programs","volume":"2","author":"Naish","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(89)90088-1_BIB42","series-title":"Logic and Databases","first-page":"33","article-title":"Database: theory vs. interpretation","author":"Nicolas","year":"1978"},{"key":"10.1016\/0304-3975(89)90088-1_BIB43","series-title":"Tech. Report","article-title":"Using automated theorem proving techniques for deductive databases","author":"Ohlbach","year":"1988"},{"key":"10.1016\/0304-3975(89)90088-1_BIB44","doi-asserted-by":"crossref","first-page":"137","DOI":"10.3115\/981311.981338","article-title":"Parsing as deduction","author":"Pereira","year":"1983","journal-title":"Proc. Meeting of the Association for Computational Linguistics"},{"key":"10.1016\/0304-3975(89)90088-1_BIB45","first-page":"193","article-title":"On the semantics of stratified deductive databases","author":"Przymusinski","year":"1987","journal-title":"Found. Deductive Databases and Logic Programming"},{"key":"10.1016\/0304-3975(89)90088-1_BIB46","first-page":"140","article-title":"Magic templates: a spellbinding approach to logic programs","author":"Ramakrishnan","year":"1988","journal-title":"Proc. 5th Int. Conf. and Symposium on Logic Programming"},{"key":"10.1016\/0304-3975(89)90088-1_BIB47","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(89)90088-1_BIB48","doi-asserted-by":"crossref","first-page":"273","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\/0304-3975(89)90088-1_BIB49","article-title":"The generalized counting method for recursive logic queries","author":"Sacca","year":"1986","journal-title":"Proc. Int. Conference on Database Theory (ICDT)"},{"key":"10.1016\/0304-3975(89)90088-1_BIB50","first-page":"104","article-title":"Implementation of recursive queries for a data language based on pure Horn logic","author":"Sacca","year":"1987","journal-title":"Proc. 4th Int. Conf. on Logic Programming"},{"key":"10.1016\/0304-3975(89)90088-1_BIB51","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/38714.38725","article-title":"Magic counting methods","author":"Sacca","year":"1987","journal-title":"Proc. ACM Conf. on the Management of Data (SIGMOD)"},{"key":"10.1016\/0304-3975(89)90088-1_BIB52","first-page":"195","article-title":"An evaluation method for stratified programs under the extended closed world assumption","author":"Seki","year":"1988","journal-title":"Proc. 5th Int. Conf. and Symp. on Logic Programming"},{"key":"10.1016\/0304-3975(89)90088-1_BIB53","first-page":"189","article-title":"Inference with recursive rules","author":"Shapiro","year":"1980","journal-title":"Proc. AAAI National Conf. on Artificial Intelligence"},{"key":"10.1016\/0304-3975(89)90088-1_BIB54","first-page":"84","article-title":"OLD resolution with tabulation","author":"Tamaki","year":"1986","journal-title":"Proc. 3rd Int. Conf. on Logic Programming"},{"key":"10.1016\/0304-3975(89)90088-1_BIB55","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"},{"key":"10.1016\/0304-3975(89)90088-1_BIB56","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/16856.16870","article-title":"A message passing framework for logical query evaluation","author":"Van Gelder","year":"1986","journal-title":"Proc. ACM Conf. of the Management of Data (SIGMOD)"},{"key":"10.1016\/0304-3975(89)90088-1_BIB57","first-page":"137","article-title":"Complexity of relational query languages","author":"Vardi","year":"1982","journal-title":"Proc. 4th ACM-SIGACT Symp. on the Theory of Computing"},{"key":"10.1016\/0304-3975(89)90088-1_BIB58","first-page":"179","article-title":"Recursive Axioms in deductive databases: the query\/subquery approach","author":"Vieille","year":"1986","journal-title":"Proc. 1st Int. Conf. on Expert Database Systems"},{"key":"10.1016\/0304-3975(89)90088-1_BIB59","series-title":"Des Bases de Donnees aux Bases de Connaissances","article-title":"Recursion in deductive databases: DedGin, a recursive query evaluator","author":"Vieille","year":"1987"},{"key":"10.1016\/0304-3975(89)90088-1_BIB60","first-page":"74","article-title":"Database-complete proof procedures based on SLD-resolution","author":"Vieille","year":"1987","journal-title":"Proc. 4th Int. Conf. on Logic Programming"},{"key":"10.1016\/0304-3975(89)90088-1_BIB61","first-page":"421","article-title":"From QSQ towards QoSaQ: Global optimization of recursive queries","author":"Vieille","year":"1988","journal-title":"Proc. 2nd Int. Conf. on Expert Database Systems"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900881?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900881?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T15:11:48Z","timestamp":1704208308000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0304397589900881"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90088-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}