{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T19:31:43Z","timestamp":1672342303829},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,6,1]],"date-time":"1990-06-01T00:00:00Z","timestamp":644198400000},"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":["Future Generation Computer Systems"],"published-print":{"date-parts":[[1990,6]]},"DOI":"10.1016\/0167-739x(90)90007-z","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T15:40:25Z","timestamp":1062603625000},"page":"35-41","source":"Crossref","is-referenced-by-count":2,"title":["A compiling approach for exploiting AND-parallelism in logic programs"],"prefix":"10.1016","volume":"6","author":[{"given":"Hwang","family":"Zhiyi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Shouren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-739X(90)90007-Z_BIB1","article-title":"The AND\/OR model for parallel interpretation of logic programs","author":"Conery","year":"1983"},{"key":"10.1016\/0167-739X(90)90007-Z_BIB2","series-title":"Proc. 1987 Supercomputing Conf.","article-title":"A technique for compiling execution graph expressions for restricted And-parallelism in logic programs","author":"DeGroot","year":"1987"},{"key":"10.1016\/0167-739X(90)90007-Z_BIB3","first-page":"218","article-title":"And-parallelism of logic programs based on a static data dependency analysis","author":"Chang","year":"1987","journal-title":"COMPCON 85"},{"key":"10.1016\/0167-739X(90)90007-Z_BIB4","series-title":"Proc. 1986 Internat. Conf. on Parallel Processing, IEEE","first-page":"984","article-title":"Detection of And-parallelism in logic programming","author":"Tung","year":"1986"},{"key":"10.1016\/0167-739X(90)90007-Z_BIB5","article-title":"The automatic generation of mode declarations for Prolog programs","author":"Melish","year":"1981"},{"key":"10.1016\/0167-739X(90)90007-Z_BIB6","series-title":"Supercomputers and AI Machines","article-title":"Restricted And-parallelism and side-effects in logic programming","author":"DeGroot","year":"1988"},{"key":"10.1016\/0167-739X(90)90007-Z_BIB7","series-title":"Lecture Notes in Computer Science, Proc. of 3rd Internat. Conf. Logic Programming","first-page":"710","article-title":"The OR-forest description for the execution of logic programs","author":"Chengzhen","year":"1986"},{"key":"10.1016\/0167-739X(90)90007-Z_BIB8","series-title":"Proc. Internat. Conf. Computer and Communication","article-title":"PSOF: A process model based on the OR-forest description","author":"Chengzheng","year":"1986"},{"key":"10.1016\/0167-739X(90)90007-Z_BIB9","series-title":"2nd Nat. Conf. Logic Programming","article-title":"SES-PIM: A simulation and experiment system for PIM-PSOF","author":"Chengzheng","year":"1986"},{"key":"10.1016\/0167-739X(90)90007-Z_BIB10","series-title":"Proc. 2nd Internat. Conf. Computers and Applications","article-title":"An automatic partition algorithm for And-parallel execution in the framework of OR-forest","author":"Chengzheng","year":"1987"},{"key":"10.1016\/0167-739X(90)90007-Z_BIB11","series-title":"Proc. Parallel Architecture and Language Europe","article-title":"A compiling approach for exploiting And-parallelism in parallel logic programming systems","author":"Zhiyi","year":"1989"},{"key":"10.1016\/0167-739X(90)90007-Z_BIB12","series-title":"3rd Nat. Conf. Logic Programming","article-title":"Analysis of RAP","author":"Zhiyi","year":"1987"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X9090007Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167739X9090007Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T12:28:51Z","timestamp":1551097731000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167739X9090007Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,6]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,6]]}},"alternative-id":["0167739X9090007Z"],"URL":"https:\/\/doi.org\/10.1016\/0167-739x(90)90007-z","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,6]]}}}