{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T04:51:05Z","timestamp":1648788665941},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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,9]]},"DOI":"10.1016\/0020-0190(93)90239-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"149-157","source":"Crossref","is-referenced-by-count":0,"title":["Efficient bottom-up execution of logic programs using abstract interpretation"],"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)90239-6_BIB1","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. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems"},{"key":"10.1016\/0020-0190(93)90239-6_BIB2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/151646.151650","article-title":"A general framework for semantics-based bottom-up abstract interpretation of logic programs","volume":"15","author":"Barbuti","year":"1993","journal-title":"ACM Trans. Programming Language Systems"},{"key":"10.1016\/0020-0190(93)90239-6_BIB3","series-title":"Tech. Rept. CS-TR-92-73","article-title":"A new two-phase abstract interpretation of logic programs","author":"Chang","year":"1992"},{"key":"10.1016\/0020-0190(93)90239-6_BIB4","first-page":"238","article-title":"Abstract interpretations: A unified lattice model for static analysis of programs by construction or approximation of fixed points","author":"Cousot","year":"1977","journal-title":"Proc. Fourth ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0020-0190(93)90239-6_BIB5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative modeling of the operational behavior of logic languages","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(93)90239-6_BIB6","first-page":"109","article-title":"A framework for an efficient implementation of deductive databases","author":"Kifer","year":"1986","journal-title":"Proc. 6th Advanced Database Symp."},{"key":"10.1016\/0020-0190(93)90239-6_BIB7","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/32.42735","article-title":"SYGRAF: Implementing logic programs in a database style","volume":"14","author":"Kifer","year":"1988","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/0020-0190(93)90239-6_BIB8","first-page":"733","article-title":"Bottom-up abstract interpretation of logic programs","author":"Marriott","year":"1988","journal-title":"Proc. 1988 Internat. Conf. and Symp. on Logic Programming"},{"key":"10.1016\/0020-0190(93)90239-6_BIB9","first-page":"31","article-title":"The generalized counting method for recursive logic queries","author":"Sacca","year":"1986","journal-title":"Proc. Internat. Conf. on Database Theory"},{"key":"10.1016\/0020-0190(93)90239-6_BIB10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(84)90119-1","article-title":"Enumeration of success patterns in logic programs","volume":"34","author":"Sato","year":"1984","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093902396?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093902396?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:49Z","timestamp":1555144069000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093902396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["0020019093902396"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90239-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}