{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:51Z","timestamp":1759638291670},"reference-count":38,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":6774,"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":[[1995,1]]},"DOI":"10.1016\/0743-1066(93)00007-f","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:44:48Z","timestamp":1027644288000},"page":"1-45","source":"Crossref","is-referenced-by-count":42,"title":["Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions"],"prefix":"10.1016","volume":"22","author":[{"given":"Manuel V.","family":"Hermenegildo","sequence":"first","affiliation":[]},{"given":"Francesca","family":"Rossi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0743-1066(93)00007-F_BIB1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the theory of logic programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(93)00007-F_BIB2","series-title":"Handbook of Theoretical Computer Science","article-title":"Introduction to Logic Programming (revised and extended version)","author":"Apt","year":"1988"},{"key":"10.1016\/0743-1066(93)00007-F_BIB3","series-title":"Fifth International Conference and Symposium on Logic Programming","first-page":"1160","article-title":"A scalable abstract machine model to support limited-OR\/restricted AND parallelism in logic programs","author":"Biswas","year":"1988"},{"key":"10.1016\/0743-1066(93)00007-F_BIB4","article-title":"A Framework for the Abstract Interpretation of Logic Programs","author":"Bruynooghe","year":"1987"},{"key":"10.1016\/0743-1066(93)00007-F_BIB5","series-title":"Compcon Spring '85","first-page":"218","article-title":"And-parallelism of logic programs based on static data dependency analysis","author":"Chang","year":"1985"},{"key":"10.1016\/0743-1066(93)00007-F_BIB6","series-title":"Proceedings of the North American Conference on Logic Programming","first-page":"350","article-title":"Restricted AND-parallelism execution model with side-effects","author":"Chang","year":"1989"},{"key":"10.1016\/0743-1066(93)00007-F_BIB7","series-title":"Ph.D. thesis","article-title":"The And\/Or Process Model for Parallel Interpretation of Logic Programs","author":"Conery","year":"1983"},{"key":"10.1016\/0743-1066(93)00007-F_BIB8","series-title":"Symp. on Logic Prog.","first-page":"457","article-title":"Binding environments for parallel logic programs in nonshared memory multiprocessors","author":"Conery","year":"1987"},{"key":"10.1016\/0743-1066(93)00007-F_BIB9","series-title":"ACM Symp. on Principles of Programming Languages","first-page":"238","article-title":"Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints","author":"Cousot","year":"1977"},{"issue":"3","key":"10.1016\/0743-1066(93)00007-F_BIB10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0743-1066(88)90010-6","article-title":"Automatic mode inference for Prolog programs","volume":"5","author":"Debray","year":"1988","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(93)00007-F_BIB11","series-title":"International Conference on Fifth Generation Computer Systems","first-page":"471","article-title":"Restricted AND-parallelism","author":"DeGroot","year":"1984"},{"key":"10.1016\/0743-1066(93)00007-F_BIB12","series-title":"Proc. of the 1987 Int. Supercomputing Conf.","first-page":"80","article-title":"A technique for compiling execution graph expressions for restricted AND-parallelism in logic programs","author":"DeGroot","year":"1987"},{"key":"10.1016\/0743-1066(93)00007-F_BIB13","series-title":"International Symposium on Logic Programming","first-page":"80","article-title":"Restricted AND-parallelism and side-effects","author":"DeGroot","year":"1987"},{"issue":"3","key":"10.1016\/0743-1066(93)00007-F_BIB14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0743-1066(89)90015-0","article-title":"Some results on the complexity of exploiting dependency in parallel logic programs","volume":"6","author":"Delcher","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(93)00007-F_BIB15","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0743-1066(93)00007-F_BIB16","series-title":"1989 North American Conference on Logic Programming","first-page":"332","article-title":"Compiled and-or parallelism on shared memory multiprocessors","author":"Gupta","year":"1989"},{"key":"10.1016\/0743-1066(93)00007-F_BIB17","series-title":"Proceedings of the Seventh International Conference on Logic Programming","first-page":"31","article-title":"Kernel Andorra Prolog and its computation model","author":"Haridi","year":"1990"},{"key":"10.1016\/0743-1066(93)00007-F_BIB18","series-title":"1990 International Conference on Logic Programming","first-page":"253","article-title":"&-Prolog and its performance: Exploiting independent And-parallelism","author":"Hermenegildo","year":"1990"},{"key":"10.1016\/0743-1066(93)00007-F_BIB19","series-title":"1989 North American Conference on Logic Programming","first-page":"369","article-title":"On the correctness and efficiency of independent and-parallelism in logic programs","author":"Hermenegildo","year":"1989"},{"key":"10.1016\/0743-1066(93)00007-F_BIB20","series-title":"1990 International Conference on Logic Programming","first-page":"237","article-title":"Non-strict independent and-parallelism","author":"Hermenegildo","year":"1990"},{"key":"10.1016\/0743-1066(93)00007-F_BIB21","doi-asserted-by":"crossref","DOI":"10.20868\/UPM.thesis.14975","article-title":"An Abstract Machine Based Execution Model for Computer Architecture Design and Efficient Implementation of Logic Programs in Parallel","author":"Hermenegildo","year":"1986"},{"key":"10.1016\/0743-1066(93)00007-F_BIB22","series-title":"Third International Conference on Logic Programming","article-title":"Efficient management of backtracking in AND-parallelism","volume":"225","author":"Hermenegildo","year":"1986"},{"key":"10.1016\/0743-1066(93)00007-F_BIB23","series-title":"European Symposium on Programming","first-page":"284","article-title":"Compilation of logic programs for restricted and-parallelism","author":"Jacobs","year":"1988"},{"key":"10.1016\/0743-1066(93)00007-F_BIB24","series-title":"1989 North American Conference on Logic Programming","article-title":"Accurate and efficient approximation of variable aliasing in logic programs","author":"Jacobs","year":"1989"},{"key":"10.1016\/0743-1066(93)00007-F_BIB25","series-title":"ACM Symp. Principles of Programming Languages","first-page":"111","article-title":"Constraint logic programming","author":"Jaffar","year":"1987"},{"key":"10.1016\/0743-1066(93)00007-F_BIB26","series-title":"Fourth IEEE Symposium on Logic Programming","first-page":"125","article-title":"Completeness and full parallelism of parallel logic programming schemes","author":"Kale","year":"1987"},{"key":"10.1016\/0743-1066(93)00007-F_BIB27","article-title":"A Parallel Implementation of Logic Programs","author":"Lin","year":"1988"},{"key":"10.1016\/0743-1066(93)00007-F_BIB28","series-title":"Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(93)00007-F_BIB29","series-title":"Third International Conference on Logic Programming","article-title":"Abstract interpretation of Prolog programs","volume":"225","author":"Mellish","year":"1986"},{"key":"10.1016\/0743-1066(93)00007-F_BIB30","series-title":"1989 International Conference on Logic programming","first-page":"80","article-title":"Complete and efficient methods for supporting side effects in independent\/restricted And-parallelism","author":"Muthukumar","year":"1989"},{"key":"10.1016\/0743-1066(93)00007-F_BIB31","series-title":"1989 North American Conference on Logic Programming","first-page":"166","article-title":"Determination of variable dependence information at compile-time through abstract interpretation","author":"Muthukumar","year":"1989"},{"key":"10.1016\/0743-1066(93)00007-F_BIB32","series-title":"1990 International Conference on Logic Programming","first-page":"221","article-title":"The CDG, UDG, and MEL methods for automatic compile-time parallelization of logic programs for independent and-parallelism","author":"Muthukumar","year":"1990"},{"key":"10.1016\/0743-1066(93)00007-F_BIB33","article-title":"An Abstract Prolog Instruction Set","author":"Warren","year":"1983"},{"key":"10.1016\/0743-1066(93)00007-F_BIB34","series-title":"Proceedings of TAPSOFT '87","article-title":"OR-parallel execution models of Prolog","author":"Warren","year":"1987"},{"key":"10.1016\/0743-1066(93)00007-F_BIB35","series-title":"Parallel Logic Programming Workshop","article-title":"The extended Andorra model with implicit control","author":"Warren","year":"1990"},{"key":"10.1016\/0743-1066(93)00007-F_BIB36","series-title":"Fifth International Conference and Symposium on Logic Programming","first-page":"684","article-title":"On the practicality of global flow analysis of logic programs","author":"Warren","year":"1988"},{"key":"10.1016\/0743-1066(93)00007-F_BIB37","series-title":"Symp. of Logic Prog.","first-page":"436","article-title":"The PEPSys model: Combining backtracking, AND- and OR-parallelism","author":"Westphal","year":"1987"},{"key":"10.1016\/0743-1066(93)00007-F_BIB38","series-title":"Fifth International Conference and Symposium on Logic Programming","first-page":"749","article-title":"Transparent and-parallelism in the presence of shared free variables","author":"Winsborough","year":"1988"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669300007F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669300007F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T01:05:55Z","timestamp":1681607155000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669300007F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["074310669300007F"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(93)00007-f","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}