{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T18:08:45Z","timestamp":1648836525829},"reference-count":35,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":5619,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0743-1066(96)00076-3","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"227-259","source":"Crossref","is-referenced-by-count":1,"title":["SLR inference: An inference system for fixed-mode logic programs, based on SLR parsing"],"prefix":"10.1016","volume":"34","author":[{"given":"David A.","family":"Rosenblueth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julio C.","family":"Peralta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(96)00076-3_BIB1","series-title":"Proc. 1984 Int. Symp. Logic Programming","first-page":"233","article-title":"Definite Clause Translation Grammars","author":"Abramson","year":"1984"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB2","series-title":"Compilers\u2014Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB3","series-title":"Proc. 1993 Int. Symp. Logic Programming","first-page":"12","article-title":"Declarative Programming in Prolog","author":"Apt","year":"1993"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB4","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/BF01213601","article-title":"Reasoning about Prolog Programs: From Modes through Types to Assertions","volume":"6A","author":"Apt","year":"1994","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0743-1066(96)00076-3_BIB5","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/321765.321780","article-title":"Decidable Properties of Monadic Functional Schemas","volume":"20","author":"Ashcroft","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB6","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/TSE.1981.234508","article-title":"Consequence Verification of Flowcharts","author":"Clark","year":"1981","journal-title":"IEEE Trans. Software Eng. SE-7"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB7","article-title":"Predicate Logic as a Computational Formalism","author":"Clark","year":"1979"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB8","series-title":"Proc. 11th Int. Logic Programming Symp.","first-page":"471","article-title":"LPDA: Another Look at Tabulation in Logic Programming","author":"Villemonte de la Clergerie","year":"1994"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB9","series-title":"Logic and Logic Grammars for Language Processing","first-page":"28","article-title":"What Kind of Grammars Are Logic Programs?","author":"Deransart","year":"1992"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB10","series-title":"A Grammatical View of Logic Programming","author":"Deransart","year":"1993"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB11","series-title":"Proc. 1987 IEEE Symp. Logic Programming","first-page":"389","article-title":"Do Logic Programs Resemble Programs in Conventional Languages?","author":"Drabent","year":"1987"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB12","article-title":"Simple Program Schemes and Formal Languages","volume":"20","author":"Engelfriet","year":"1974"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB13","series-title":"Semantics Directed Compiler Generation","first-page":"393","article-title":"Attibute-Influenced LR Parsing","volume":"94","author":"Jones","year":"1980"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB14","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/S0019-9958(65)90426-2","article-title":"On the Translation of Languages from Left to Right","volume":"8","author":"Knuth","year":"1965","journal-title":"Information Control"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB15","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01692511","article-title":"Semantics of Context-Free Languages","volume":"2","author":"Knuth","year":"1968","journal-title":"Math. Syst. Theory"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB16","series-title":"Proc. 2nd Colloquium Automata, Languages and Programming","first-page":"255","article-title":"Deterministic Techniques for Efficient Non-deterministic Parsers","author":"Lang","year":"1974"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB17","article-title":"Complete Evaluation of Horn Clauses: An Automata Theoretic Approach","author":"Lang","year":"1988"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB18","series-title":"Proc. 3rd Int. Conf. Data Knowledge Bases","first-page":"389","article-title":"Datalog Automata","author":"Lang","year":"1988"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB19","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB20","first-page":"799","article-title":"Recursive Algorithms and Formal Languages","volume":"20","author":"Mazurkiewicz","year":"1972","journal-title":"Bull. Acad. Polon. Sci. S\u00e9r. Sci. Math. Astr. Phys."},{"key":"10.1016\/S0743-1066(96)00076-3_BIB21","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF03037391","article-title":"AID: An Alternative Implementation of DCGs","volume":"4","author":"Nilsson","year":"1986","journal-title":"New Generation Comput."},{"key":"10.1016\/S0743-1066(96)00076-3_BIB22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(80)90003-X","article-title":"Definite Clause Grammars for Language Analysis\u2014A Survey of the Formalism and a Comparison with Augmented Transition Networks","volume":"13","author":"Pereira","year":"1980","journal-title":"Artif. Intell."},{"key":"10.1016\/S0743-1066(96)00076-3_BIB23","series-title":"21st Annual Meeting Association Computational Linguistics","first-page":"137","article-title":"Parsing as Deduction","author":"Pereira","year":"1983"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB24","article-title":"Fixed-Mode Logic Programs as State-Oriented Programs","author":"Rosenblueth","year":"1991"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB25","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF03037212","article-title":"Chart Parsers as Inference Systems for Fixed-Mode Logic Programs","volume":"14","author":"Rosenblueth","year":"1996","journal-title":"New Generation Comput."},{"key":"10.1016\/S0743-1066(96)00076-3_BIB26","series-title":"Proc. Int. Logic Programming Symp.","first-page":"439","article-title":"LR Inference: Inference Systems for Fixed-Mode Logic Programs, Based on LR Parsing","author":"Rosenblueth","year":"1994"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321203.321204","article-title":"On Ianov's Program Schemata","volume":"11","author":"Rutledge","year":"1964","journal-title":"J. ACM"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB28","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."},{"key":"10.1016\/S0743-1066(96)00076-3_BIB29","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB30","series-title":"Proc. 1st Nat. Conf. Artif. Intell.","first-page":"383","article-title":"Deterministic and Bottom-Up Parsing in Prolog","author":"Stabler","year":"1983"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB31","first-page":"382","article-title":"A Direct Proof for the Completeness of SLD-Resolution","volume":"89","author":"St\u00e4rk","year":"1990"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB32","series-title":"Proc. Second Int. Logic Programming Conf.","first-page":"127","article-title":"Unfold\/Fold Transformation of Logic Programs","author":"Tamaki","year":"1984"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB33","first-page":"31","article-title":"An Efficient Augmented-Context-Free Parsing Algorithm","volume":"13","author":"Tomita","year":"1987","journal-title":"Computat. Linguistics"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB34","series-title":"Proc. 1984 Int. Symp. Logic Programming","first-page":"220","article-title":"A Bottom-Up Parser Based on Predicate Logic: A Survey of the Formalism and Its Implementation Technique","author":"Uehara","year":"1984"},{"key":"10.1016\/S0743-1066(96)00076-3_BIB35","series-title":"Proc. Int. Workshop Programming Languages Implementation Logic Programming PLILP '88","first-page":"132","article-title":"Coupled Context-Free Grammar as a Programming Paradigm","author":"Yamashita","year":"1988"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106696000763?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106696000763?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T08:21:19Z","timestamp":1556526079000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106696000763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0743106696000763"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(96)00076-3","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}