{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:46:30Z","timestamp":1648579590453},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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,10]]},"DOI":"10.1016\/0020-0190(93)90133-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"237-244","source":"Crossref","is-referenced-by-count":0,"title":["Static filtering on stratified programs"],"prefix":"10.1016","volume":"47","author":[{"given":"Byeong-Mo","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwang-Moo","family":"Choe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taisook","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90133-T_BIB1","series-title":"Foundation of Deductive 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)90133-T_BIB2","series-title":"Tech. Rept. 89\/17","article-title":"Efficient bottom-up computations on recursively defined deductive databases","author":"Balbin","year":"1989"},{"key":"10.1016\/0020-0190(93)90133-T_BIB3","first-page":"711","article-title":"A query independent method for magic set computation on stratified databases","author":"Balbin","year":"1988","journal-title":"Proc. Internat. Conf. on Fifth Generation Computer Systems"},{"key":"10.1016\/0020-0190(93)90133-T_BIB4","series-title":"Tech. Rept. CS-TR-92-72","article-title":"Fixed point computation of static filters for stratified programs","author":"Chang","year":"1992"},{"key":"10.1016\/0020-0190(93)90133-T_BIB5","series-title":"Logic and Database","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/0020-0190(93)90133-T_BIB6","first-page":"719","article-title":"Efficient query answering on stratified databases","author":"Kerisit","year":"1988","journal-title":"Proc. Internat. Conf. on Fifth Generation Computer Systems"},{"key":"10.1016\/0020-0190(93)90133-T_BIB7","first-page":"109","article-title":"A framework for an efficient implementation of deductive database systems","author":"Kifer","year":"1986","journal-title":"Proc. 6th Advanced Database Symp."},{"issue":"3","key":"10.1016\/0020-0190(93)90133-T_BIB8","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/88636.87121","article-title":"On compile time query optimization in deductive databased by means of static filtering","volume":"15","author":"Kifer","year":"1990","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0020-0190(93)90133-T_BIB9","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"177","article-title":"On the declarative semantics of logic programs with negation","author":"Lifschitz","year":"1988"},{"key":"10.1016\/0020-0190(93)90133-T_BIB10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","article-title":"Negation as failure: a computation of Clark's completed data base and Reiter's closed world assumption","volume":"2","author":"Shepherdson","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0020-0190(93)90133-T_BIB11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice theoretical fixed point theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390133T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390133T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:05Z","timestamp":1555129685000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390133T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["002001909390133T"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90133-t","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}