{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T12:56:32Z","timestamp":1772024192808,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,4,1]],"date-time":"1985-04-01T00:00:00Z","timestamp":481161600000},"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":10336,"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":[[1985,4]]},"DOI":"10.1016\/0743-1066(85)90004-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"43-66","source":"Crossref","is-referenced-by-count":105,"title":["Some global optimizations for a PROLOG compiler"],"prefix":"10.1016","volume":"2","author":[{"given":"C.S.","family":"Mellish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(85)90004-4_BIB1","article-title":"Solving Mechanics Problems Using Meta-Level Inference","author":"Bundy","year":"1979","journal-title":"Proc. IJCAI-79"},{"key":"10.1016\/0743-1066(85)90004-4_BIB2","series-title":"Programming in Prolog","author":"Clocksin","year":"1981"},{"key":"10.1016\/0743-1066(85)90004-4_BIB3","article-title":"Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints","author":"Cousot","year":"1977","journal-title":"Principles of Programming Languages"},{"key":"10.1016\/0743-1066(85)90004-4_BIB4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in Networks of Relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(85)90004-4_BIB5","article-title":"The Prolog Phenomenon","volume":"72","author":"McDermott","year":"1980","journal-title":"Sigart Newsletter"},{"key":"10.1016\/0743-1066(85)90004-4_BIB6","series-title":"Ph.D. Thesis","article-title":"Coping with Uncertainty: Noun Phrase Interpretation and Early Semantic Analysis","author":"Mellish","year":"1981"},{"key":"10.1016\/0743-1066(85)90004-4_BIB7","series-title":"Research Report 163","article-title":"The Automatic Generation of Mode Declarations for Prolog Programs","author":"Mellish","year":"1981"},{"key":"10.1016\/0743-1066(85)90004-4_BIB8","series-title":"Cognitive Studies Research Report","article-title":"Natural Language Generation from Plans","author":"Mellish","year":"1984"},{"key":"10.1016\/0743-1066(85)90004-4_BIB9","article-title":"Integrating Prolog into the POPLOG Environment","author":"Mellish","year":"1983","journal-title":"Proc. IJCAI-83"},{"key":"10.1016\/0743-1066(85)90004-4_BIB10","series-title":"Ph.D. Thesis","article-title":"Resolving Lexical Ambiguity in a Deterministic Parser","author":"Milne","year":"1983"},{"key":"10.1016\/0743-1066(85)90004-4_BIB11","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09981-6_19","article-title":"The Theory and Practice of Transforming Call-by-need into Call-by-value","author":"Mycroft","year":"1980"},{"key":"10.1016\/0743-1066(85)90004-4_BIB12","article-title":"The Occur-Check Problem in Prolog","author":"Plaisted","year":"1984","journal-title":"Proc. International Symposium on Logic Programming"},{"issue":"No. 1","key":"10.1016\/0743-1066(85)90004-4_BIB13","doi-asserted-by":"crossref","DOI":"10.1145\/942578.807086","article-title":"Calculating Properties of Programs by Valuations on Specific Models","volume":"7","author":"Sintzoff","year":"1972","journal-title":"Sigplan Notices"},{"key":"10.1016\/0743-1066(85)90004-4_BIB14","article-title":"Towards a Pipelined Prolog Processor","author":"Tick","year":"1984","journal-title":"Proc. International Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(85)90004-4_BIB15","series-title":"Research Report 39","article-title":"Implementing Prolog\u2014Compiling Predicate Logic Programs","author":"Warren","year":"1977"},{"key":"10.1016\/0743-1066(85)90004-4_BIB16","article-title":"An Improved Prolog Implementation which Optimises Tail Recursion","author":"Warren","year":"1980","journal-title":"Proc. Logic Programming Workshop"},{"key":"10.1016\/0743-1066(85)90004-4_BIB17","first-page":"110","article-title":"An Efficient Easily Adaptable System for Interpreting Natural Language Queries","volume":"8","author":"Warren","year":"1982","journal-title":"American Journal of Computational Linguistics"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106685900044?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106685900044?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:12Z","timestamp":1555127652000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106685900044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,4]]}},"alternative-id":["0743106685900044"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(85)90004-4","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1985,4]]}}}