{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T16:37:32Z","timestamp":1693845452423},"reference-count":12,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"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":7962,"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":[[1991,10]]},"DOI":"10.1016\/0743-1066(91)90031-j","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"345-358","source":"Crossref","is-referenced-by-count":1,"title":["Decomposability and its role in parallel logic-program evaluation"],"prefix":"10.1016","volume":"11","author":[{"given":"Ouri","family":"Wolfson","sequence":"first","affiliation":[]},{"given":"Avi","family":"Silberschatz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(91)90031-J_BIB1","first-page":"210","article-title":"The Parallel Complexity of Simple Chain Queries","author":"Afrati","year":"1987","journal-title":"Proceedings of the 6th ACM Symposium on PODS"},{"key":"10.1016\/0743-1066(91)90031-J_BIB2","first-page":"214","article-title":"Bounds on the Propagation of Selection into Logic Programs","author":"Beeri","year":"1987","journal-title":"Proceedings of the 6th ACM Symposium on PODS"},{"key":"10.1016\/0743-1066(91)90031-J_BIB3","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/16856.16859","article-title":"An Amateur's Introduction to Recursive Query Processing","author":"Bancilhon","year":"1986","journal-title":"Proceedings of the SIGMOD Conference"},{"key":"10.1016\/0743-1066(91)90031-J_BIB4","first-page":"280","article-title":"Parallel Evaluation of Recursive Rule Queries","author":"Cosmadakis","year":"1986","journal-title":"Proceedings of the 5th ACM Symposium on PODS"},{"key":"10.1016\/0743-1066(91)90031-J_BIB5","first-page":"200","article-title":"Why a Single Parallelization Strategy is Not Enough in Knowledge Bases","author":"Cohen","year":"1989","journal-title":"Proceedings of the 8th ACM Symposium on PODS"},{"key":"10.1016\/0743-1066(91)90031-J_BIB6","series-title":"TR 801","article-title":"Towards an Algebraic Theory of Recursion","author":"Ioannidis","year":"1988"},{"key":"10.1016\/0743-1066(91)90031-J_BIB7","series-title":"Proceedings of ICDT'86, International Conference on Database Theory","first-page":"1","article-title":"Logic Programming and Parallel Complexity","volume":"243","author":"Kanellakis","year":"1986"},{"key":"10.1016\/0743-1066(91)90031-J_BIB8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","article-title":"Closures and Fairness in the Semantics of Programming Logic","volume":"29","author":"Lassez","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(91)90031-J_BIB9","series-title":"Computing with Logic: Introduction to Logic Programming","author":"Maier","year":"1987"},{"key":"10.1016\/0743-1066(91)90031-J_BIB10","first-page":"1","article-title":"Database Theory: Past and Future","author":"Ullman","year":"1987","journal-title":"Proceedings of the 6th ACM Symposium on PODS"},{"key":"10.1016\/0743-1066(91)90031-J_BIB11","unstructured":"Ullman, J.D. and Van Gelder, A., Parallel Complexity of Logic Programs, TR STAN-CS-85-1089, Stanford Univ."},{"issue":"4","key":"10.1016\/0743-1066(91)90031-J_BIB12","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The Semantics of Predicate Logic as a Programming Language","volume":"23","author":"Van Emden","year":"1976","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669190031J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669190031J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:56:30Z","timestamp":1555113390000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669190031J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":12,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["074310669190031J"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(91)90031-j","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}