{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:32:09Z","timestamp":1720625529358},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T00:00:00Z","timestamp":1416441600000},"content-version":"vor","delay-in-days":4920,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s1571-0661(04)00148-3","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T10:34:35Z","timestamp":1075977275000},"page":"29-44","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Operational Semantics for Reexecution-based Analysis of Logic Programs with Delay Declarations"],"prefix":"10.1016","volume":"48","author":[{"given":"Agostino","family":"Cortesi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabina","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baudouin","family":"Le Charleir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB1","series-title":"\u201cFrom Logic Programming to Prolog\u201d","author":"Apt","year":"1997"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB2","series-title":"Lecture Notes in Computer Science 936","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-60043-4_47","article-title":"\u201cVerification of Logic Programs with Delay Declarations\u201d","author":"Apt","year":"1995"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB3","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\/S1571-0661(04)00148-3_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Cortesi A., B. Le Charlier and P. Van Hentenryck, Combination of abstract domains for logic programming, in: Proceedings of the 21th ACM SIGPLAN\u2013SIGACT Symposium on Principles of Programming Languages (POPL'94) (1994), pp. 7\u201321.","DOI":"10.1145\/174675.177880"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0167-6423(99)00045-3","article-title":"Combination of abstract domains for logic programming: open product and generic pattern construction","volume":"28","author":"Cortesi","year":"2000","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Cousot P. and R. Cousot, Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Conference Record of Fourth ACM Symposium on Programming Languages (POPL'77) (1977), pp. 238\u2013252.","DOI":"10.1145\/512950.512973"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB7","doi-asserted-by":"crossref","unstructured":"Cousot P. and R. Cousot, Systematic design of program analysis frameworks, in: Conference Record of Sixth ACM Symposium on Programming Languages (POPL'79) (1979), pp. 269\u2013282.","DOI":"10.1145\/567752.567778"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1006\/inco.1997.2638","article-title":"Constraint logic programming with dynamic scheduling: A semantics based on closure operators","volume":"137","author":"Falaschi","year":"1997","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB9","unstructured":"Garcia de la Banda, M., K. Marriott and P. Stuckey, Efficient analysis of logic programs with dynamic scheduling, in: J. Lloyd, editor, Proceedings of the 12st International Logic Programming Symposium (1995), pp. 417\u2013431."},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB10","unstructured":"Intelligent Systems Laboratory, Swedish Institute of Computer Science, Kista, Sweden, \u201cSICStus Prolog User's Manual,\u201d (1998). URL http:\/\/www.sics.se\/isl\/sicstus\/sicstus_toc.html"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/174625.174627","article-title":"Experimental Evaluation of a Generic Abstract Interpretation Algorithm for Prolog","volume":"16","author":"Le Charlier","year":"1994","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01178260","article-title":"Reexecution in abstract interpretation of Prolog","volume":"32","author":"Le Charlier","year":"1995","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB13","series-title":"Symbolic Computation - Artificial Intelligence","article-title":"\u201cFoundations of Logic Programming\u201d","author":"Lloyd","year":"1987"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB14","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0743-1066(98)10034-1","article-title":"Proving termination of logic programs with delay declarations","volume":"39","author":"Marchiori","year":"1999","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB15","doi-asserted-by":"crossref","unstructured":"Marriott K., M. Garcia de la Banda and M. Hermenegildo, Analyzing logic programs with dynamic scheduling, in: Proceedings of the 21st Annual ACM Symp. on Principles of Programming Languages (1994), pp. 240\u2013253.","DOI":"10.1145\/174675.177883"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB16","series-title":"Lecture Notes in Computer Science 238","article-title":"\u201cNegation and control in Prolog\u201d","author":"Naish","year":"1986"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0743-1066(94)00029-6","article-title":"Evaluation of the domain Prop","volume":"23","author":"Van Hentenryck","year":"1995","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1571-0661(04)00148-3_NEWBIB18","doi-asserted-by":"crossref","unstructured":"Yelick K. and J. Zachary, Moded type systems for logic programming, in: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages (POPL'89) (1989), pp. 116\u2013124.","DOI":"10.1145\/75277.75287"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001483?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104001483?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T06:57:32Z","timestamp":1550213852000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104001483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":18,"alternative-id":["S1571066104001483"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00148-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}