{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:40:10Z","timestamp":1736106010173,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603597"},{"type":"electronic","value":"9783540450481"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0026834","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:29:45Z","timestamp":1132396185000},"page":"431-448","source":"Crossref","is-referenced-by-count":2,"title":["A dataflow semantics for constraint logic programs"],"prefix":"10.1007","author":[{"given":"Livio","family":"Colussi","sequence":"first","affiliation":[]},{"given":"Elena","family":"Marchiori","sequence":"additional","affiliation":[]},{"given":"Massimo","family":"Marchiori","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"issue":"29","key":"26_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","volume":"19","author":"A. Bossi","year":"1994","unstructured":"A. Bossi, M. Gabbrielli, G. Levi, and M. Martelli. The s-semantics approach: theory and applications. The Journal of Logic Programming, 19,29: 149\u2013197, 1994.","journal-title":"The Journal of Logic Programming"},{"key":"26_CR2","first-page":"308","volume":"74","author":"R.M. Burstall","year":"1974","unstructured":"R.M. Burstall. Program proving as hand simulation with a little induction. Information Processing, 74:308\u2013312, 1974.","journal-title":"Information Processing"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(93)90248-R","volume":"120","author":"P. Cousot","year":"1993","unstructured":"P. Cousot and R. Cousot. \u201cA la Burstall\u201d Intermittent Assertions Induction Principles for Proving Inevitability Properties of Programs. Theoretical Computer Science, 120:123\u2013155, 1993.","journal-title":"Theoretical Computer Science"},{"key":"26_CR4","unstructured":"L. Colussi and E. Marchiori. Proving correctness of logic programs using axiomatic semantics. In Proceedings of the Eight ICLP, pages 629\u2013644. MIT Press, 1991."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"L. Colussi, E. Marchiori and M. Marchiori. On Termination of Constraint Logic Programs. In Proc. First International Conference on Principles and Practice of Constraint Programming. LNCS, Springer-Verlag, 1995. To appear.","DOI":"10.1007\/3-540-60299-2_26"},{"issue":"1","key":"26_CR6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0304-3975(88)90099-0","volume":"59","author":"W. Drabent","year":"1988","unstructured":"W. Drabent and J. Ma\u0142uszy\u0144ski. Inductive assertion method for logic programs. TCS, 59(1):133\u2013155, 1988.","journal-title":"TCS"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"P. Deransart and J. Ma\u0142uszy\u0144ski. A Grammatical View of Logic Programming. The MIT Press, 1993.","DOI":"10.7551\/mitpress\/3345.001.0001"},{"issue":"3","key":"26_CR8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/129393.129398","volume":"14","author":"J. Jaffar","year":"1992","unstructured":"J. Jaffar, S. Michaylov, P.J. Stuckey and R.H.C. Yap. The CLP(R) Language and System. ACM TOPLAS, 14(3):339\u2013395, 1992.","journal-title":"ACM TOPLAS"},{"issue":"20","key":"26_CR9","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"J. Jaffar and M.J. Maher. Constraint Logic Programming: A Survey. JLP 19,20: 503\u2013581, 1994.","journal-title":"JLP"},{"key":"26_CR10","volume-title":"Computer Science Technical Report 719","author":"K. Kunnen","year":"1987","unstructured":"K. Kunnen. Signed Data Dependency in Logic Programs. Computer Science Technical Report 719, University of Wisconsin-Madison, 1987."},{"key":"26_CR11","unstructured":"C. Mellish. Abstract interpretation of Prolog programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of declarative languages, pp. 181\u2013198. Ellis Horwood, 1987."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli. How to cook a proof system for your pet language. In Proceedings 10th Annual ACM Symposium on Principles of Programming Languages (POPL), pp. 141\u2013154, 1983.","DOI":"10.1145\/567067.567082"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"U. Nilsson. Systematic semantics approximations of logic programs. In Proc. PLILP, pp. 293\u2013306. Eds. P. Deransart and J. Ma\u0142uszynski, Springer Verlag, 1990.","DOI":"10.1007\/BFb0024191"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"C. Stirling. Modal and Temporal Logics. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, vol-ume 2, pages 477\u2013563, 1992.","DOI":"10.1093\/oso\/9780198537618.003.0005"},{"issue":"1","key":"26_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(94)90004-3","volume":"21","author":"B. Wang","year":"1994","unstructured":"B. Wang and R.K. Shyamasundar. A methodology for proving termination of logic programs. JLP 21(1): 1\u201330, 1994.","journal-title":"JLP"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:12:15Z","timestamp":1736104335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603597","9783540450481"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0026834","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}