{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T21:55:45Z","timestamp":1648504545104},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5678,"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,1]]},"DOI":"10.1016\/s0743-1066(97)00062-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"43-57","source":"Crossref","is-referenced-by-count":3,"title":["A new term representation method for prolog"],"prefix":"10.1016","volume":"34","author":[{"given":"Xining","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(97)00062-9_BIB1","first-page":"101","article-title":"The Sharing of Structure in Theorem Proving Programs","volume":"Vol. 7","author":"Boyer","year":"1972"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB2","article-title":"Logic Programming and Compiler Writing","author":"Warren","year":"1977"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB3","series-title":"Implementations of Logic Programing Systems","first-page":"103","article-title":"MProlog: An Implementation Overview","author":"Farkas","year":"1994"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB4","article-title":"An Interpreter for Predicate Programs: Part 1","author":"Bruynooghe","year":"1976"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB5","author":"Warren","year":"1983","journal-title":"An Abstract Prolog Instruction Set, Technical Note 209., SIR International"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB6","series-title":"Warren's Abstract Machine: A Tutorial Reconstruction","author":"Ait-Kaci","year":"1991"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB7","series-title":"PLILP'90, LNCS","first-page":"121","article-title":"The Vienna Abstract Machine","author":"Krall","year":"1990"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB8","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/2.108055","article-title":"High-Performance Logic Programming with the Aquarius Prolog Compiler","volume":"25","author":"Van Roy","year":"1992","journal-title":"IEEE Computer"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB9","series-title":"ICLP'90","first-page":"174","article-title":"LIPS on a MIPS: Results from a Prolog Compiler to RISC","author":"Taylor","year":"1990"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB10","series-title":"Implementations of Logic Programming Systems","author":"Tick","year":"1994"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB11","series-title":"ICLP'95","first-page":"317","article-title":"wamcc: Compiling Prolog to C","author":"Codognet","year":"1995"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB12","series-title":"Warren's Abstract Machine: A Tutorial Reconstruction","first-page":"xiii","article-title":"Foreword","author":"Warren","year":"1991"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB13","series-title":"Logic Programming","first-page":"99","article-title":"An Alternative to Structure Sharing in the Implementation of a Prolog Interpreter","author":"Mellish","year":"1982"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB14","series-title":"Logic Programming","first-page":"83","article-title":"The Memory Management of Prolog Implementations","author":"Bruynooghe","year":"1982"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB15","series-title":"Proc. 1996 Compulog Net Workshop on Parallelism and Implementation Technologies for (Constraint) Logic Languages","first-page":"119","article-title":"Structure Sharing and Structure Copying Revisited","author":"Li","year":"1996"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB16","series-title":"PLILP'96, LNCS 1140","first-page":"259","article-title":"Program Sharing: A New Implementation Approach for Prolog","author":"Li","year":"1996"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB17","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0743-1066(88)90012-X","article-title":"The Occur-Check Problem Revisited","volume":"5","author":"Beer","year":"1988","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB18","series-title":"Implementation of Prolog","first-page":"259","article-title":"Garbage Collection in Prolog Interpreters","author":"Bruynooghe","year":"1984"},{"key":"10.1016\/S0743-1066(97)00062-9_BIB19","series-title":"Garbage Collection: Algorithms for Automatic Dynamic Memory Management","author":"Jones","year":"1996"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697000629?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697000629?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T22:51:28Z","timestamp":1556319088000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106697000629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0743106697000629"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(97)00062-9","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}