{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,7]],"date-time":"2024-01-07T00:01:41Z","timestamp":1704585701788},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0020-0190(93)90154-2","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T23:27:56Z","timestamp":1034292476000},"page":"31-41","source":"Crossref","is-referenced-by-count":4,"title":["The generalized supplementary magic-sets transformation for stratified Datalog"],"prefix":"10.1016","volume":"47","author":[{"given":"Michael","family":"Meskes","sequence":"first","affiliation":[]},{"given":"J\u00f6rg","family":"Noack","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90154-2_BIB1","series-title":"Foundations of Declarative Databases and Logic Programming","first-page":"89","article-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0020-0190(93)90154-2_BIB2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0743-1066(91)90030-S","article-title":"Efficient bottom-up computation of queries on stratified databases","volume":"11","author":"Balbin","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/0020-0190(93)90154-2_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/6012.15399","article-title":"Magic sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986","journal-title":"Proc. 8th ACM Symp. on Principles of Database Systems"},{"key":"10.1016\/0020-0190(93)90154-2_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 SIGMOD Conf. on Management of DATA"},{"key":"10.1016\/0020-0190(93)90154-2_BIB5","series-title":"Logic Programming and Databases","author":"Ceri","year":"1990"},{"key":"10.1016\/0020-0190(93)90154-2_BIB6","first-page":"178","article-title":"Completeness of a top-down query evaluation procedure for stratified databases","author":"Kemp","year":"1988","journal-title":"Proc. 5th Internat. Conf. Symp. on Logic Programming"},{"key":"10.1016\/0020-0190(93)90154-2_BIB7","series-title":"Diploma Thesis","article-title":"Implementierung und Evaluierung einer erweiterten Datalog-Sprache auf der Basis von Ingres","author":"Meskes","year":"1991"},{"key":"10.1016\/0020-0190(93)90154-2_BIB8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/298514.298558","article-title":"Modular stratification and magic sets for DATALOG programs with negation","author":"Ross","year":"1990","journal-title":"Proc. 9th ACM Symp. on Principles of Database Systems"},{"key":"10.1016\/0020-0190(93)90154-2_BIB9","series-title":"Proc. 4th Internat. Conf. on Logic Programming","first-page":"104","article-title":"Implementation of recursive queries for a data language based on pure Horn logic","author":"Sacca","year":"1987"},{"key":"10.1016\/0020-0190(93)90154-2_BIB10","first-page":"235","article-title":"Is there anything better than magic?","author":"Sagiv","year":"1990","journal-title":"Proc. 10th North American Conf. on Logic Programming"},{"key":"10.1016\/0020-0190(93)90154-2_BIB11","volume":"Vol. I & II","author":"Ullman","year":"1989"},{"key":"10.1016\/0020-0190(93)90154-2_BIB12","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/73721.73736","article-title":"Bottom-up beats top-down for Datalog","author":"Ullman","year":"1989","journal-title":"Proc. 8th ACM Symp. on Principles of Database Systems"},{"key":"10.1016\/0020-0190(93)90154-2_BIB13","first-page":"179","article-title":"Recursive axioms in deductive databases: The query-subquery approach","author":"Vieille","year":"1986","journal-title":"Proc. 1st Internat. Conf. on Expert Database Systems"},{"key":"10.1016\/0020-0190(93)90154-2_BIB14","series-title":"Proc. 4th Internat. Conf. on Logic Programming","first-page":"74","article-title":"A database-complete proof procedure based on SLD-resolution","author":"Vieille","year":"1987"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093901542?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093901542?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T08:40:51Z","timestamp":1704530451000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093901542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["0020019093901542"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90154-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}