{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:35:04Z","timestamp":1725755704124},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642859854"},{"type":"electronic","value":"9783642859830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/978-3-642-85983-0_10","type":"book-chapter","created":{"date-parts":[[2013,11,8]],"date-time":"2013-11-08T02:56:12Z","timestamp":1383879372000},"page":"261-288","source":"Crossref","is-referenced-by-count":3,"title":["Denotational Semantics of Constraint Logic Programming \u2014 A Nonstandard Approach"],"prefix":"10.1007","author":[{"given":"Erik","family":"Palmgren","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"574","volume-title":"Handbook of Theoretical Computer Science (ed. J. van Leeuwen), 493 \u2014","author":"KR Apt","year":"1990","unstructured":"Apt, K.R., Logic Programming, In: Handbook of Theoretical Computer Science (ed. J. van Leeuwen), 493 \u2014 574, North-Holland, Amsterdam, 1990."},{"key":"10_CR2","unstructured":"Blair, H.A., Brown, A.L., Definite Clause Programs are Canonical (over a Suitable Domain), Annals of Mathematics in Artificial Intelligence,to appear."},{"key":"10_CR3","unstructured":"Bruynooghe, M., Boulanger, D., Abstract Interpretation for (Constraint) Logic Programming, this volume."},{"key":"10_CR4","volume-title":"Uppsala University","author":"B Carlson","year":"1989","unstructured":"Carlson, B., A Characterisation of Logic Programming in Domain Theory, Master Thesis, Department of Computing Science, Uppsala University, 1989."},{"key":"10_CR5","volume-title":"Uppsala University","author":"B Carlson","year":"1991","unstructured":"Carlson, B., An Approximation Theory for Constraint Logic Programs, Licentiate Thesis, Department of Computing Science, Uppsala University, 1991."},{"key":"10_CR6","unstructured":"Chang, C.C., Keisler, H.J., Model Theory, 3rd ed., North-Holland, Amsterdam, 1990."},{"key":"10_CR7","volume-title":"Logic Programming (eds. K.L. Clark and S.-A. T\u00e4rnlund), 231 \u2014 251, Academic Press","author":"A Colmerauer","year":"1982","unstructured":"Colmerauer, A., Prolog and Infinite Trees, In: Logic Programming (eds. K.L. Clark and S.-A. T\u00e4rnlund), 231 \u2014 251, Academic Press, 1982."},{"key":"10_CR8","unstructured":"Courcelle, B., Fundamental Properties of Infinite Trees, Theoretical Computer Science,25 (1983) 95 \u2014 169."},{"key":"10_CR9","volume-title":"University of Amsterdam","author":"K Doets","year":"1992","unstructured":"Doets, K., Levationis Laus, manuscript, University of Amsterdam, 1992."},{"key":"10_CR10","unstructured":"Doets, K., From Logic to Logic Programming,MIT Press, to appear."},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0743-1066(88)90016-7","volume":"5","author":"W. Golson","year":"1988","unstructured":"Golson, W., Toward a Declarative Semantics for Infinite Objects in Logic Programming, Journal of Logic Programming,5(1988) 151 \u2014 164.","journal-title":"Journal of Logic Programming"},{"key":"10_CR12","volume-title":"Monash University","author":"J Jaffar","year":"1986","unstructured":"Jaffar, J., Lassez, J.-L., Constraint Logic Programming, Technical Report, Department of Computer Science, Monash University, 1986."},{"key":"10_CR13","first-page":"315","volume-title":"Logic Programming 87 (eds. K. Furukawa, H. Tanaka and T. Fujisaki), 1\u2014 18, Lecture Notes in Computer Science vol","author":"J Jaffar","year":"1987","unstructured":"Jaffar, J., Lassez, J.-L., From Unification to Constraints, In: Logic Programming \u201887 (eds. K. Furukawa, H. Tanaka and T. Fujisaki), 1\u2014 18, Lecture Notes in Computer Science vol. 315, Springer, Berlin, 1987."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Stuckey, P., Semantics of Infinite Tree Logic Programming, Theoretical Computer Science,46(1986) 141 \u2014 158.","DOI":"10.1016\/0304-3975(86)90027-7"},{"key":"10_CR15","volume-title":"Xerox Parc Report","author":"R Jagadeesan","year":"1991","unstructured":"Jagadeesan, R., Shanbhogue, V., Saraswat, V.A., Angelic Non-determinism in Concurrent Constraint Programming, Xerox Parc Report 1991."},{"key":"10_CR16","first-page":"125","volume":"20","author":"B. J\u00f3nsson","year":"1968","unstructured":"J\u00f3nsson, B., Olin, P., Almost Direct Products and Saturation, Compositio Mathematica,20(1968) 125 \u2014 132.","journal-title":"Compositio Mathematica"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"Kunen, K., Negation in Logic Programming, Journal of Logic Programming,4(1987) 289 \u2014 308.","journal-title":"Journal of Logic Programming"},{"key":"10_CR18","first-page":"526","volume-title":"Theoretical Aspects of Computer Software 91 (eds. T. Ito and A.R. Meyer), 420 \u2014 446, Lecture Notes in Computer Science, vol","author":"J-L Lassez","year":"1991","unstructured":"Lassez, J.-L., From LP to LP: Programming with Constraints, In: Theoretical Aspects of Computer Software \u201881 (eds. T. Ito and A.R. Meyer), 420 \u2014 446, Lecture Notes in Computer Science, vol. 526, Springer, Berlin, 1991."},{"key":"10_CR19","unstructured":"Lassez, J.-L., McAloon, K., A Constraint Sequent Calculus, In: Proceedings of the 1990 Symposium on Logic in Computer Science, IEEE Computer Society Press, Washington D.C., 1990."},{"key":"10_CR20","unstructured":"Laugwitz, D., Ein Weg zur Nonstandard-Analysis, Jahresbericht der Deutsche Mathematiker Verein, 1973(75) 66\u201393."},{"key":"10_CR21","unstructured":"Levi, G., Martelli, M., Palamidessi, C., A New Success and Finite Failure Semantics of Positive Logic Programs, manuscript, 1990."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Lindstrom, T., An Invitation to Nonstandard Analysis, In: Nonstandard Analysis and its Applications (ed. N. Cutland), Cambridge University Press, Cambridge, 1988. Lloyd, J.W., Foundations of Logic Programming, Springer, Berlin, 1984.","DOI":"10.1017\/CBO9781139172110.002"},{"key":"10_CR23","first-page":"632","volume-title":"Algebraic and Logic Programming (eds. H. Kirchner and G. Levi), 364 \u2014 383, Lecture Notes in Computer Science, vol","author":"MJ Maher","year":"1992","unstructured":"Maher, M.J., A CLP View of Logic Programming, In: Algebraic and Logic Programming (eds. H. Kirchner and G. Levi), 364 \u2014 383, Lecture Notes in Computer Science, vol. 632, Springer, Berlin, 1992."},{"key":"10_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-65374-2","volume-title":"Algebraic Systems","author":"AI Mal\u2019cev","year":"1973","unstructured":"Mal\u2019cev, A.I., Algebraic Systems, Springer, Berlin, 1973."},{"key":"10_CR25","first-page":"417","volume-title":"COLOG-88 Computer Logic (eds. P. Martin-L\u00f6f and G.E. Mints), Lecture Notes in Computer Science, vol","author":"P Martin-L\u00f6f","year":"1989","unstructured":"Martin-L\u00f6f, P., Mathematics of Infinity, In: COLOG-88 Computer Logic (eds. P. Martin-L\u00f6f and G.E. Mints), Lecture Notes in Computer Science, vol. 417, Springer, Berlin, 1989."},{"key":"10_CR26","unstructured":"Mayoh, B., Tyugu, E., Uustalu, T., Constraint Satisfaction and Constraint Programming: A Brief Lead-in, this volume."},{"key":"10_CR27","unstructured":"Moschovakis, Y.N., Elementary Induction on Abstract Structures, North-Holland, Amsterdam, 1974."},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Nait Abdallah, M.A., On the Interpretation of Infinite Computations in Logic Programming, In: Proceedings of ICALP \u201884, (ed. J. Paradaens), 358 \u2014 370, Lecture Notes in Computer Science, vol. 172, Springer, Berlin, 1984.","DOI":"10.1007\/3-540-13345-3_32"},{"key":"10_CR29","unstructured":"Palmgren, E., Nonstandard Models of Constraint Logic Programs, Department of Mathematics Report 1992:10, Uppsala University."},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Palyutin, E.A., Algebra and Logic, 19 (1980).","DOI":"10.1007\/BF01669610"},{"key":"10_CR31","volume-title":"Proc. ACM symposium on principles of programming languages","author":"VA Saraswat","year":"1991","unstructured":"Saraswat, V.A., Rinard, M., Panangaden, P. Semantic Foundation for Concurrent Constraint Programming, In: Proc. ACM symposium on principles of programming languages, 1991."},{"key":"10_CR32","unstructured":"Stoltenberg-Hansen, V., Griffor, E., Lindstr\u00f6m, I., Mathematical Theory of Domains, Cambridge University Press, to appear."},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Weijland, W.F., Semantics for Logic Programs without Occur Check, Theoretical Computer Science, 1990(71) 155\u2013174.","DOI":"10.1016\/0304-3975(90)90194-M"}],"container-title":["NATO ASI Series","Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-85983-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T15:03:02Z","timestamp":1596812582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-85983-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783642859854","9783642859830"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-85983-0_10","relation":{},"ISSN":["0258-1248"],"issn-type":[{"type":"print","value":"0258-1248"}],"subject":[],"published":{"date-parts":[[1994]]}}}