{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:25:28Z","timestamp":1648772728356},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":8963,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1989]]},"DOI":"10.1016\/0166-218x(92)90278-i","type":"journal-article","created":{"date-parts":[[2002,12,10]],"date-time":"2002-12-10T21:10:39Z","timestamp":1039554639000},"page":"121-131","source":"Crossref","is-referenced-by-count":0,"title":["Fixpoint strategies for deductive databases"],"prefix":"10.1016","volume":"24","author":[{"given":"Ir\u00e8ne","family":"Guessarian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90278-I_BIB1","series-title":"Proceedings 5th PODS","article-title":"Magic sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0166-218X(92)90278-I_BIB2","author":"Bancilhon","year":"1986","journal-title":"An amateur's introduction to recursive query processing strategies"},{"key":"10.1016\/0166-218X(92)90278-I_BIB3","series-title":"Graphes","author":"Berge","year":"1983"},{"key":"10.1016\/0166-218X(92)90278-I_BIB4","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\/0166-218X(92)90278-I_BIB5","series-title":"Proceedings 16th STOC","article-title":"Uniform definability of finite structures with successor","author":"de Rougemont","year":"1984"},{"key":"10.1016\/0166-218X(92)90278-I_BIB6","unstructured":"M. de Rougemont, Private communication."},{"key":"10.1016\/0166-218X(92)90278-I_BIB7","unstructured":"M. de Rougemont, Calculabilit\u00e9 et bases de donn\u00e9es, to appear."},{"key":"10.1016\/0166-218X(92)90278-I_BIB8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/356924.356929","article-title":"Logic and data bases: a deductive approach","volume":"16","author":"Gallaire","year":"1984","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0166-218X(92)90278-I_BIB9","author":"Gardarin","year":"1987","journal-title":"Optimization of extended datalog recursive programs using fixpoint functional equations"},{"key":"10.1016\/0166-218X(92)90278-I_BIB10","author":"Gardarin","year":"1986","journal-title":"Evaluation of data base recursive logic programs as recurrent function series"},{"key":"10.1016\/0166-218X(92)90278-I_BIB11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(89)90009-1","article-title":"Translation of datalog rules into functional fixpoint equations","volume":"63","author":"Gardarin","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(92)90278-I_BIB12","first-page":"387","article-title":"Some fixpoint techniques in algebraic structures and applications to computer science","volume":"X","author":"Guessarian","year":"1987","journal-title":"Fund. Inform."},{"key":"10.1016\/0166-218X(92)90278-I_BIB13","first-page":"1","article-title":"Fixpoint techniques in data base recursive logic programs","volume":"22","author":"Guessarian","year":"1988","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0166-218X(92)90278-I_BIB14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2422.2423","article-title":"On compiling queries in recursive first-order data bases","volume":"31","author":"Henschen","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(92)90278-I_BIB15","author":"Bancilhon","year":"1987","journal-title":"Bounds on the propagation of selection into logic programs"},{"key":"10.1016\/0166-218X(92)90278-I_BIB16","doi-asserted-by":"crossref","first-page":"285","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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290278I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290278I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:55:51Z","timestamp":1555134951000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290278I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989]]}},"alternative-id":["0166218X9290278I"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90278-i","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1989]]}}}