{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:54:24Z","timestamp":1760061264532,"version":"build-2065373602"},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":5800,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100007273","name":"Comisi\u00f3n Interministerial de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007273","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100012439","name":"Commission for Environmental Cooperation","doi-asserted-by":"publisher","award":["CHRX-CT94-0624","ISC-IL-90-PARFORCE"],"award-info":[{"award-number":["CHRX-CT94-0624","ISC-IL-90-PARFORCE"]}],"id":[{"id":"10.13039\/100012439","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003176","name":"Ministerio de Educaci\u00f3n, Cultura y Deporte","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003176","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1016\/s0743-1066(96)00143-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"247-261","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Exploiting goal independence in the analysis of logic programs"],"prefix":"10.1016","volume":"32","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Garc\u00eda De La Banda","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0743-1066(96)00143-4_BIB1","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/151646.151650","article-title":"A General Framework for Semantics-Based Bottom-Up Abstract Interpretation of Logic Programs","volume":"15","author":"Barbuti","year":"1993","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"10.1016\/S0743-1066(96)00143-4_BIB2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","article-title":"A Practical Framework for the Abstract Interpretation of Logic Programs","volume":"10","author":"Bruynooghe","year":"1991","journal-title":"Journal of Logic Programming"},{"article-title":"Live-Structure Analysis for Logic Programming Languages with Declarations","year":"1996","author":"Bruynooghe","key":"10.1016\/S0743-1066(96)00143-4_BIB3"},{"key":"10.1016\/S0743-1066(96)00143-4_BIB4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(94)90055-8","article-title":"Bottom-Up Abstract Interpretation of Logic Programs","volume":"124","author":"Codish","year":"1994","journal-title":"Journal of Theoretical Computer Science"},{"key":"10.1016\/S0743-1066(96)00143-4_BIB5","series-title":"Proceedings of the Fifth International Conference on Logic Programming and Automated Reasoning, LNAI 822","first-page":"305","article-title":"Goal Dependent vs Goal Independent Analysis of Logic Programs","author":"Codish","year":"1994"},{"issue":"3","key":"10.1016\/S0743-1066(96)00143-4_BIB6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0743-1066(95)00064-X","article-title":"Analysing Logic Programs Using \u201cProp\u201d-ositional Logic Programs and a Magic Wand","volume":"25","author":"Codish","year":"1995","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"10.1016\/S0743-1066(96)00143-4_BIB7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/200994.200998","article-title":"Improving Abstract Interpretations by Combining Domains","volume":"17","author":"Codish","year":"1995","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0743-1066(96)00143-4_BIB8","series-title":"Proceedings of the Fifth International Symposium on Programming Language Implementation and Logic Programming, LNCS","article-title":"Efficient Bottom-Up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains","author":"Corsini","year":"1993"},{"key":"10.1016\/S0743-1066(96)00143-4_BIB9","series-title":"Proceedings of the Sixth IEEE Symposium on Logic in Computer Science","first-page":"322","article-title":"Prop Revisited: Propositional Formula as Abstract Domain for Groundness Analysis","author":"Cortesi","year":"1991"},{"key":"10.1016\/S0743-1066(96)00143-4_BIB10","series-title":"Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP'92), LNCS 623","first-page":"521","article-title":"Comparison of Abstract Interpretations","author":"Cortesi","year":"1992"},{"issue":"2","key":"10.1016\/S0743-1066(96)00143-4_BIB11","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0743-1066(95)00123-9","article-title":"Optimal Groundness Analysis Using Propositional Logic","volume":"27","author":"Cortesi","year":"1996","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(96)00143-4_BIB12","series-title":"Proceedings of the Fourth ACM Symposium 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":"2\/3","key":"10.1016\/S0743-1066(96)00143-4_BIB13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","article-title":"Abstract Interpretation and Application to Logic Programs","volume":"13","author":"Cousot","year":"1992","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"10.1016\/S0743-1066(96)00143-4_BIB14","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative Modeling of the Operational Behavior of Logic Languages","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0743-1066(96)00143-4_BIB15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF03037136","article-title":"Specialisation of Prolog and FCP Programs Using Abstract Interpretation","volume":"6","author":"Gallagher","year":"1988","journal-title":"New Generation Computing"},{"issue":"2\/3","key":"10.1016\/S0743-1066(96)00143-4_BIB16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0743-1066(92)90034-Z","article-title":"Static Analysis of Logic Programs for Independent and Parallelism","volume":"13","author":"Jacobs","year":"1992","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(96)00143-4_BIB17","series-title":"Proceedings of the 1995 International Symposium on Logic Programming","first-page":"336","article-title":"A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs","author":"Janssens","year":"1995"},{"issue":"3","key":"10.1016\/S0743-1066(96)00143-4_BIB18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0743-1066(94)00029-6","article-title":"Groundness Analysis for Prolog: Implementation and Evaluation of the Domain Prop","volume":"23","author":"Le Charlier","year":"1995","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"10.1016\/S0743-1066(96)00143-4_BIB19","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/174625.174627","article-title":"Experimental Evaluation of a Generic Abstraction Interpretation Algorithm for Prolog","volume":"16","author":"Le Charlier","year":"1994","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0743-1066(96)00143-4_BIB20","series-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming","article-title":"Bottom-Up Abstract Interpretation of Logic Programs","author":"Marriott","year":"1988"},{"issue":"1\u20134","key":"10.1016\/S0743-1066(96)00143-4_BIB21","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/176454.176519","article-title":"Precise and Efficient Groundness Analysis for Logic Programs","volume":"2","author":"Marriott","year":"1993","journal-title":"ACM Letters on Programming Languages and Systems"},{"issue":"2","key":"10.1016\/S0743-1066(96)00143-4_BIB22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/174662.174664","article-title":"Live-Structure Data-Flow Analysis for Prolog","volume":"16","author":"Mulkers","year":"1994","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2\/3","key":"10.1016\/S0743-1066(96)00143-4_BIB23","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0743-1066(92)90035-2","article-title":"Compile-Time Derivation of Variable Dependency Using Abstract Interpretation","volume":"13","author":"Muthukumar","year":"1992","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S0743-1066(96)00143-4_BIB24","series-title":"Proceedings of ESOP 86, LNCS 213","first-page":"327","article-title":"An Application of Abstract Interpretation of Logic Programs: Occur-Check Reduction","author":"S\u00f8ndergaard","year":"1986"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106696001434?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106696001434?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:45:59Z","timestamp":1760046359000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106696001434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0743106696001434"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(96)00143-4","relation":{},"ISSN":["0743-1066"],"issn-type":[{"type":"print","value":"0743-1066"}],"subject":[],"published":{"date-parts":[[1997,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Exploiting goal independence in the analysis of logic programs","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0743-1066(96)00143-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}