{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:51:00Z","timestamp":1754556660443},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,6,1]],"date-time":"1998-06-01T00:00:00Z","timestamp":896659200000},"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":5525,"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":[[1998,6]]},"DOI":"10.1016\/s0304-3975(97)00272-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"167-198","source":"Crossref","is-referenced-by-count":4,"title":["Information flow in tabular interpretations for generalized push-down automata"],"prefix":"10.1016","volume":"199","author":[{"given":"Eric Villemonte","family":"de la Clergerie","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Barth\u00e9lemy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00272-7_BIB1","series-title":"Compilers: Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB2","series-title":"Proc. 5th ACM Symp. on Principles of Database Systems (PODS)","article-title":"Magic-set and other strange ways to implement logic programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB3","series-title":"Proc. PLILP'92, Springer","first-page":"100","article-title":"Subsumption-oriented Push-Down Automata","author":"Barth\u00e9lemy","year":"1992"},{"issue":"4","key":"10.1016\/S0304-3975(97)00272-7_BIB4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1145\/356827.356831","article-title":"Tabulation techniques for recursive programs","volume":"12","author":"Bird","year":"1980","journal-title":"ACM Comput. Survey"},{"issue":"2","key":"10.1016\/S0304-3975(97)00272-7_BIB5","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\/S0304-3975(97)00272-7_BIB6","series-title":"Proc. Nobel Symp. on Text Processing","article-title":"Algorithm schemata and data structures in syntactic processing","author":"Kay","year":"1980"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB7","first-page":"255","article-title":"Deterministic techniques for efficient non-deterministic parsers","volume":"vol. 14","author":"Lang","year":"1974"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB8","article-title":"Complete evaluation of Horn clauses: an automata theoretic approach","author":"Lang","year":"1988"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB9","series-title":"Proc. ILCP'91","article-title":"A generic abstract interpretation algorithm and its complexity analysis","author":"Le Charlier","year":"1991"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB10","series-title":"Proc. 27th Ann. Meeting of the Association for Computational Linguistics, ACL","first-page":"135","article-title":"How to cover a grammar","author":"Leermakers","year":"1989"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB11","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB12","article-title":"Linguistic parsing and program transformations","author":"Nederhof","year":"1994"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB13","series-title":"Proc. 21st Ann. Meeting of the Association for Computational Linguistics","first-page":"137","article-title":"Parsing as deduction","author":"Pereira","year":"1983"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB14","series-title":"Proc. SIGMOD'94 Conf., ACM","article-title":"XSB as an efficient deductive database engine","author":"Sagonas","year":"1994"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB15","series-title":"Proc. 23rd Ann. Meeting of the Association for Computational Linguistics","first-page":"145","article-title":"Using restriction to extend parsing algorithms for complex-feature-based formalisms","author":"Shieber","year":"1985"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-60541-3","article-title":"Parsing schemata","author":"Sikkel","year":"1993"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB17","series-title":"Proc. 3rd Internat. Conf. on Logic Programming","first-page":"84","article-title":"OLD resolution with tabulation","author":"Tamaki","year":"1986"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(97)00272-7_BIB18","article-title":"An efficient augmented-context-free parsing algorithm","volume":"13","author":"Tomita","year":"1987","journal-title":"Comput. Linguistics"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB19","series-title":"Proc. 4th Internat. Conf. on Logic Programming","article-title":"Database-complete proof procedures based on SLD resolution","author":"Vieille","year":"1987"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB20","series-title":"Current Issues in Parsing Technologies","article-title":"Polynomial parsing of extension of context-free grammars","author":"Vijay-Shanker","year":"1991"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB21","article-title":"Automates \u00e1 Piles et Programmation Dynamique. DyALog: Une application \u00e1 la programmation en Logique","author":"de la Clergerie","year":"1993"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB22","series-title":"Proc. POPL'93","first-page":"345","article-title":"Layer sharing: an improved structure-sharing framework","author":"de la Clergerie","year":"1993"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB23","series-title":"Technical Note","article-title":"Modulated Call\/Return evaluation strategies for logic programs","author":"de la Clergerie","year":"1997"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB24","series-title":"Proc. 11th Internat. Conf. on Logic Programming (ICLP'94), MIT Press","first-page":"470","article-title":"LPDA: another look at tabulation in logic programming","author":"de la Clergerie","year":"1994"},{"key":"10.1016\/S0304-3975(97)00272-7_BIB25","article-title":"An abstract instruction set for Prolog","author":"Warren","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002727?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002727?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:26:39Z","timestamp":1556522799000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,6]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,6]]}},"alternative-id":["S0304397597002727"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00272-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,6]]}}}