{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:24:43Z","timestamp":1757629483701,"version":"3.44.0"},"reference-count":29,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1988,10,1]],"date-time":"1988-10-01T00:00:00Z","timestamp":591667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,10,1]],"date-time":"1988-10-01T00:00:00Z","timestamp":591667200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1988,10]]},"DOI":"10.1016\/0743-7315(88)90010-x","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"494-516","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["A technique for compiling execution graph expressions for restricted and-parallelism in logic programs"],"prefix":"10.1016","volume":"5","author":[{"given":"Doug","family":"DeGroot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"article-title":"Data Dependence in Ordinary Programs","year":"1976","author":"Banerjee","key":"10.1016\/0743-7315(88)90010-X_BIB1"},{"key":"10.1016\/0743-7315(88)90010-X_BIB2","series-title":"submitted to the 1988 Hawaii International Conference on System Sciences","article-title":"A Distributed Prolog System with And-Parallelism","author":"Carlton","year":"1988"},{"key":"10.1016\/0743-7315(88)90010-X_BIB3","series-title":"Proc. of the Spring Compcon 85","first-page":"281","article-title":"AND-parallelism of logic programs based on a static data-dependency analysis","author":"Chang","year":"1985"},{"key":"10.1016\/0743-7315(88)90010-X_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/5001.5390","article-title":"PARLOG: Parallel programming in logic","author":"Clark","year":"1986","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0743-7315(88)90010-X_BIB5","series-title":"Proc. of the Conf on Functional Programming Languages and Computer Architecture","first-page":"163","article-title":"Parallel interpretation of logic programs","author":"Conery","year":"1981"},{"year":"1987","series-title":"Parallel Execution of Logic Programs","author":"Conery","key":"10.1016\/0743-7315(88)90010-X_BIB6"},{"key":"10.1016\/0743-7315(88)90010-X_BIB7","series-title":"Proc. of the 1986 Symposium on Logic Programming","first-page":"78","article-title":"Automatic mode inference for Prolog programs","author":"Debray","year":"1986"},{"key":"10.1016\/0743-7315(88)90010-X_BIB8","series-title":"Proc. of the International Conference on Fifth Generation Computer Systems","first-page":"471","article-title":"Restricted and-parallelism","author":"DeGroot","year":"1984"},{"key":"10.1016\/0743-7315(88)90010-X_BIB9","series-title":"Hardware and Software Components and Architectures for the 5th Generation","first-page":"271","article-title":"A comparison of two and-parallel execution models","author":"DeGroot","year":"1985"},{"key":"10.1016\/0743-7315(88)90010-X_BIB10","series-title":"Proc. of the Symposium on Logic Programming","article-title":"Restricted and-parallelism and side-effects","author":"DeGroot","year":"1987"},{"key":"10.1016\/0743-7315(88)90010-X_BIB11","series-title":"Parallel Processing for Supercomputers and AI Machines","article-title":"Restricted and-parallelism and side-effects in logic programming","author":"DeGroot","year":"1988"},{"key":"10.1016\/0743-7315(88)90010-X_BIB12","series-title":"Advanced Semiconductor Technology and Computer Systems","article-title":"And-parallelism in logic programs","author":"DeGroot","year":"1988"},{"year":"1988","series-title":"A Restricted And-Parallel Execution Model and Abstract Machine for Prolog Programs","author":"Hermenegildo","key":"10.1016\/0743-7315(88)90010-X_BIB13"},{"key":"10.1016\/0743-7315(88)90010-X_BIB14","unstructured":"Jacobs, Dean, and Langen, Anno. Compilation of logic programs for restricted and-parallelism, Univ. of Southern California, in press."},{"year":"1986","series-title":"Constraint Logic Programming","author":"Jaffar","key":"10.1016\/0743-7315(88)90010-X_BIB15"},{"key":"10.1016\/0743-7315(88)90010-X_BIB16","series-title":"Proc. of the IMP Congress","first-page":"569","article-title":"Predicate logic as a programming language","author":"Kowalski","year":"1974"},{"volume":"Vol. 1","year":"1978","author":"Kuck","key":"10.1016\/0743-7315(88)90010-X_BIB17"},{"year":"1984","series-title":"Foundations of Logic Programming","author":"Lloyd","key":"10.1016\/0743-7315(88)90010-X_BIB18"},{"article-title":"The Automatic Generation of Mode Declarations for Prolog Programs","year":"1981","author":"Mellish","key":"10.1016\/0743-7315(88)90010-X_BIB19"},{"key":"10.1016\/0743-7315(88)90010-X_BIB20","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0743-1066(85)90004-4","article-title":"Some global optimizations for a Prolog compiler","volume":"1","author":"Mellish","year":"1985","journal-title":"J. Logic Programming"},{"article-title":"Parallel Execution of Horn Clause Programs","year":"1981","author":"Pollard","key":"10.1016\/0743-7315(88)90010-X_BIB21"},{"key":"10.1016\/0743-7315(88)90010-X_BIB22","series-title":"Logic Programming: Functions, Relations, and Equations","first-page":"3","article-title":"On the relationship between logic and functional languages","author":"Reddy","year":"1986"},{"article-title":"A Subset of Concurrent Prolog and Its Interpreter","year":"1983","author":"Shapiro","key":"10.1016\/0743-7315(88)90010-X_BIB23"},{"year":"1986","series-title":"The Art of Prolog","author":"Shapiro","key":"10.1016\/0743-7315(88)90010-X_BIB24"},{"issue":"3","key":"10.1016\/0743-7315(88)90010-X_BIB25","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1147\/rd.303.0242","article-title":"The average complexity of depth-first search with backtracking and cutoff","volume":"30","author":"Stone","year":"1986","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0743-7315(88)90010-X_BIB26","series-title":"Proc. of the 1986 Int I Conf on Parallel Processing","first-page":"984","article-title":"Detection of and-parallelism in logic programming","author":"Tung","year":"1986"},{"article-title":"Parallel Processing Model for Logic Programming","year":"1986","author":"Tung","key":"10.1016\/0743-7315(88)90010-X_BIB27"},{"article-title":"An Abstract Prolog Instruction Set","year":"1983","author":"Warren","key":"10.1016\/0743-7315(88)90010-X_BIB28"},{"year":"1986","series-title":"Prolog Multiprocessors","author":"Wise","key":"10.1016\/0743-7315(88)90010-X_BIB29"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373158890010X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373158890010X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:30Z","timestamp":1757514570000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373158890010X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,10]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1988,10]]}},"alternative-id":["074373158890010X"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(88)90010-x","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1988,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A technique for compiling execution graph expressions for restricted and-parallelism in logic programs","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(88)90010-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}