{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:38:10Z","timestamp":1725557890171},"publisher-location":"Berlin, Heidelberg","reference-count":68,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143083"},{"type":"electronic","value":"9783642143090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14309-0_11","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T13:09:58Z","timestamp":1277298598000},"page":"231-253","source":"Crossref","is-referenced-by-count":2,"title":["Concurrent and Reactive Constraint Programming"],"prefix":"10.1007","author":[{"given":"Maurizio","family":"Gabbrielli","sequence":"first","affiliation":[]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[]},{"given":"Frank D.","family":"Valencia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"CWI Monographs","first-page":"61","volume-title":"Mathematics and Computer Science II","author":"J. Bergstra","year":"1986","unstructured":"Bergstra, J., Klop, J.: Process algebra: specification and verification in bisimulation semantics. In: Mathematics and Computer Science II. CWI Monographs, pp. 61\u201394. North-Holland, Amsterdam (1986)"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0167-6423(92)90005-V","volume":"19","author":"G. Berry","year":"1992","unstructured":"Berry, G., Gonthier, G.: The esterel synchronous programming language: Design, semantics, implementation. Sci. Comput. Program.\u00a019(2), 87\u2013152 (1992)","journal-title":"Sci. Comput. Program."},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/10720327_13","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M. Bertolino","year":"2000","unstructured":"Bertolino, M., Etalle, S., Palamidessi, C.: The replacement operation for CCP programs. In: Bossi, A. (ed.) LOPSTR 1999. LNCS, vol.\u00a01817, pp. 216\u2013233. Springer, Heidelberg (2000)"},{"key":"11_CR4","unstructured":"Birkhoff, G.: Lattice theory, XXV. AMS Colloquium Publications (1967)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-68265-3_4","volume-title":"Coordination Models and Languages","author":"S. Bistarelli","year":"2008","unstructured":"Bistarelli, S., Gabbrielli, M., Meo, M.C., Santini, F.: Timed soft concurrent constraint programs. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol.\u00a05052, pp. 50\u201366. Springer, Heidelberg (2008)"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/1149114.1149118","volume":"7","author":"S. Bistarelli","year":"2006","unstructured":"Bistarelli, S., Montanari, U., Rossi, F.: Soft concurrent constraint programming. ACM Trans. Comput. Log.\u00a07(3), 563\u2013589 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.entcs.2009.03.020","volume":"236","author":"S. Bistarelli","year":"2009","unstructured":"Bistarelli, S., Santini, F.: A nonmonotonic soft concurrent constraint language for sla negotiation. Electr. Notes Theor. Comput. Sci.\u00a0236, 147\u2013162 (2009)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/828.833","volume":"31","author":"S. Brookes","year":"1984","unstructured":"Brookes, S., Hoare, C., Roscoe, W.: A theory of communicating sequential processes. Journal of ACM\u00a031, 499\u2013560 (1984)","journal-title":"Journal of ACM"},{"key":"11_CR9","unstructured":"Buchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. Int. Cong. on Logic, Methodology, and Philosophy of Science, pp. 1\u201311. Stanford University Press (1962)"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. J. ACM\u00a024(1), 44\u201367 (1977)","journal-title":"J. ACM"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-78663-4_10","volume-title":"Trustworthy Global Computing","author":"M. Buscemi","year":"2008","unstructured":"Buscemi, M., Melgratti, H.: Transactional service level agreement. In: Barthe, G., Fournet, C. (eds.) TGC 2007. LNCS, vol.\u00a04912, pp. 124\u2013139. Springer, Heidelberg (2008)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-71316-6_3","volume-title":"Programming Languages and Systems","author":"M. Buscemi","year":"2007","unstructured":"Buscemi, M., Montanari, U.: Cc-pi: A constraint-based language for specifying service level agreements. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 18\u201332. Springer, Heidelberg (2007)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-78739-6_20","volume-title":"Programming Languages and Systems","author":"M. Buscemi","year":"2008","unstructured":"Buscemi, M., Montanari, U.: Open bisimulation for the concurrent constraint pi-calculus. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol.\u00a04960, pp. 254\u2013268. Springer, Heidelberg (2008)"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/5001.5390","volume":"8","author":"K. Clark","year":"1986","unstructured":"Clark, K., Gregory, S.: PARLOG: parallel programming in logic. ACM Trans. on Programming Languages and Systems\u00a08(1), 1\u201349 (1986)","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","first-page":"165","volume-title":"Mathematical Foundations of Computer Science 1989","author":"F. Boer de","year":"1989","unstructured":"de Boer, F., Kok, J., Palamidessi, C., Rutten, J.: Control flow versus logic: a denotational and a declarative model for Guarded Horn Clauses. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol.\u00a0379, pp. 165\u2013176. Springer, Heidelberg (1989)"},{"key":"11_CR16","series-title":"Series in Logic Programming","first-page":"621","volume-title":"Proc. of the Sixth International Conference on Logic Programming","author":"F. Boer de","year":"1989","unstructured":"de Boer, F., Kok, J., Palamidessi, C., Rutten, J.: Semantic models for a version of PARLOG. In: Levi, G., Martelli, M. (eds.) Proc. of the Sixth International Conference on Logic Programming, Lisboa. Series in Logic Programming, pp. 621\u2013636. MIT Press, Cambridge (1989); Extended version in [17]"},{"key":"#cr-split#-11_CR17.1","doi-asserted-by":"crossref","unstructured":"de Boer, F., Kok, J., Palamidessi, C., Rutten, J.: Semantic models for Concurrent Logic Languages. Theoretical Computer Science??86(1), 3???33 (1991);","DOI":"10.1016\/0304-3975(91)90003-K"},{"key":"#cr-split#-11_CR17.2","unstructured":"A short version appeared on Proceedings of the Seventh International Conference on Logic Programming, Lisboa (1989)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","first-page":"296","volume-title":"TAPSOFT\/CAAP 1991","author":"F. Boer de","year":"1991","unstructured":"de Boer, F., Palamidessi, C.: A Fully Abstract Model for Concurrent Constraint Programming. In: Abramsky, S., Maibaum, T. (eds.) CAAP 1991 and TAPSOFT 1991. LNCS, vol.\u00a0493, pp. 296\u2013319. Springer, Heidelberg (1991)"},{"key":"11_CR19","first-page":"145","volume-title":"Proc. of ALPUK 1992, Workshops in Computing","author":"F. Boer de","year":"1992","unstructured":"de Boer, F., Palamidessi, C.: On the semantics of concurrent constraint programming. In: Broda, K. (ed.) Proc. of ALPUK 1992, Workshops in Computing, pp. 145\u2013173. Springer, Heidelberg (1992)"},{"issue":"5","key":"11_CR20","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/265943.265954","volume":"19","author":"F.S. Boer de","year":"1997","unstructured":"de Boer, F.S., Gabbrielli, M., Marchiori, E., Palamidessi, C.: Proving concurrent constraint programs correct. ACM Transactions on Programming Languages and Systems\u00a019(5), 685\u2013725 (1997)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1006\/inco.1999.2879","volume":"161","author":"F.S. Boer de","year":"2000","unstructured":"de Boer, F.S., Gabbrielli, M., Meo, M.C.: A timed concurrent constraint language. Inf. Comput.\u00a0161(1), 45\u201383 (2000)","journal-title":"Inf. Comput."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"de Boer, F.S., Gabbrielli, M., Meo, M.C.: A temporal logic for reasoning about timed concurrent constraint programs. In: TIME, pp. 227\u2013233 (2001)","DOI":"10.1109\/TIME.2001.930721"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","first-page":"83","volume-title":"Static Analysis","author":"F.S. Boer de","year":"1996","unstructured":"de Boer, F.S., Gabbrielli, M., Palamidessi, C.: Proving correctness of constraint logic programs with dynamic scheduling. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol.\u00a01145, pp. 83\u201397. Springer, Heidelberg (1996)"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0039054","volume-title":"CONCUR \u201990","author":"F.S. Boer de","year":"1990","unstructured":"de Boer, F.S., Palamidessi, C.: On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 99\u2013114. Springer, Heidelberg (1990)"},{"issue":"1","key":"11_CR25","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(95)00047-Z","volume":"151","author":"F.S. Boer de","year":"1995","unstructured":"de Boer, F.S., Pierro, A.D., Palamidessi, C.: Nondeterminism and infinite computations in constraint programming. Theoretical Computer Science\u00a0151(1), 37\u201378 (1995)","journal-title":"Theoretical Computer Science"},{"key":"11_CR26","series-title":"Australian Computer Science Communications","first-page":"245","volume-title":"Proc. 4th Australasian Theory Symposium, CATS 1998","author":"A. Pierro Di","year":"1998","unstructured":"Di Pierro, A., Wiklicky, H.: A Banach Space Based Semantics for Probabilistic Concurrent Constraint Programming. In: Lin, X. (ed.) Proc. 4th Australasian Theory Symposium, CATS 1998, Singapore. Australian Computer Science Communications, vol.\u00a020 \u2013 3, pp. 245\u2013259. Springer, Heidelberg (1998)"},{"key":"11_CR27","series-title":"IEEE Computer Society and ACM SIGPLAN","first-page":"174","volume-title":"Proc. ICCL 1998 \u2013 International Conference on Computer Languages","author":"A. Pierro Di","year":"1998","unstructured":"Di Pierro, A., Wiklicky, H.: An Operational Semantics for Probabilistic Concurrent Constraint Programming. In: Iyer, Y.C.P., Schmidt, D. (eds.) Proc. ICCL 1998 \u2013 International Conference on Computer Languages, Chicago. IEEE Computer Society and ACM SIGPLAN, pp. 174\u2013183. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/BFb0055794","volume-title":"Mathematical Foundations of Computer Science 1998","author":"A. Pierro Di","year":"1998","unstructured":"Di Pierro, A., Wiklicky, H.: Probabilistic Concurrent Constraint Programming: Towards a Fully Abstract Model. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, p. 446. Springer, Heidelberg (1998)"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Di Pierro, A., Wiklicky, H.: Concurrent Constraint Programming: Towards Probabilistic Abstract Interpretation. In: Gabbrielli, M., Pfenning, F. (eds.) Proceedings of PPDP 2000 \u2013 Priciples and Practice of Declarative Programming, Montr\u00e9al, Canada, September 2000. ACM SIGPLAN, pp. 127\u2013138. Association of Computing Machinery, New York (2000)","DOI":"10.1145\/351268.351284"},{"key":"11_CR30","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-44654-0_11","volume-title":"New Trends in Constraints","author":"A. Pierro Di","year":"2000","unstructured":"Di Pierro, A., Wiklicky, H.: Quantitative observables and averages in Probabilistic Concurrent Constraint Programming. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS (LNAI), vol.\u00a01865, pp. 212\u2013236. Springer, Heidelberg (2000)"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","volume-title":"25 Years of Logic Programming in Italy","year":"2010","unstructured":"Dovier, A., Pontelli, E. (eds.): 25 Years of Logic Programming in Italy. LNCS, vol.\u00a06125. Springer, Heidelberg (2010)"},{"issue":"3","key":"11_CR32","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1145\/503502.503504","volume":"23","author":"S. Etalle","year":"2001","unstructured":"Etalle, S., Gabbrielli, M., Meo, M.C.: Transformations of ccp programs. ACM Trans. Program. Lang. Syst.\u00a023(3), 304\u2013395 (2001)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"11_CR33","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/LICS.1993.287586","volume-title":"Proc. of the Eight Annual IEEE Symposium on Logic in Computer Science","author":"M. Falaschi","year":"1993","unstructured":"Falaschi, M., Gabbrielli, M., Marriott, K., Palamidessi, C.: Compositional analysis for concurrent constraint programming. In: Proc. of the Eight Annual IEEE Symposium on Logic in Computer Science, pp. 210\u2013221. IEEE Computer Society Press, Los Alamitos (1993)"},{"issue":"2","key":"11_CR34","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(97)00328-9","volume":"183","author":"M. Falaschi","year":"1997","unstructured":"Falaschi, M., Gabbrielli, M., Marriott, K., Palamidessi, C.: Confluence in concurrent constraint programming. Theoretical Computer Science\u00a0183(2), 281\u2013315 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"11_CR35","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(97)00328-9","volume":"183","author":"M. Falaschi","year":"1997","unstructured":"Falaschi, M., Gabbrielli, M., Marriott, K., Palamidessi, C.: Confluence in concurrent constraint programming. Theoretical Computer Science\u00a0183(2), 281\u2013315 (1997)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"11_CR36","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/inco.1997.2638","volume":"137","author":"M. Falaschi","year":"1997","unstructured":"Falaschi, M., Gabbrielli, M., Marriott, K., Palamidessi, C.: Constraint Logic Programming with Dynamic Scheduling: A Semantics Based on Closure Operators. Information and Computation\u00a0137(1), 41\u201367 (1997)","journal-title":"Information and Computation"},{"key":"11_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-540-74610-2_19","volume-title":"Logic Programming","author":"M. Falaschi","year":"2007","unstructured":"Falaschi, M., Olarte, C., Palamidessi, C., Valencia, F.: Declarative diagnosis of temporal concurrent constraint programs. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 271\u2013285. Springer, Heidelberg (2007)"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Falaschi, M., Olarte, C., Valencia, F.: A framework for abstract interpretation of timed concurrent constraint programs. In: Proc. of PPDP 2009, ACM Sigplan, pp. 107\u2013118 (2009)","DOI":"10.1145\/1599410.1599436"},{"key":"11_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/3-540-61756-6_84","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"N.D. Francesco","year":"1996","unstructured":"Francesco, N.D., Santone, A.: Unfold\/fold transformations of concurrent processes. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol.\u00a01140, pp. 167\u2013181. Springer, Heidelberg (1996)"},{"key":"11_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/3-540-53162-9_40","volume-title":"Algebraic and Logic Programming","author":"M. Gabbrielli","year":"1990","unstructured":"Gabbrielli, M., Levi, G.: Unfolding and fixpoint semantics for concurrent constraint logic programs. In: Kirchner, H., Wechler, W. (eds.) ALP 1990. LNCS, vol.\u00a0463, pp. 204\u2013216. Springer, Heidelberg (1990)"},{"key":"11_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/978-3-642-14309-0_4","volume-title":"25 Years of Logic Programming in Italy, ch. 4","author":"M. Gavanelli","year":"2010","unstructured":"Gavanelli, M., Rossi, F.: Constraint Logic Programming. In: Dovier, A., Pontelli, E. (eds.) 25 Years of Logic Programming in Italy, ch. 4. LNCS, pp. 64\u201385. Springer, Heidelberg (2010)"},{"issue":"3","key":"11_CR42","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0743-1066(95)00038-0","volume":"25","author":"R. Giacobazzi","year":"1995","unstructured":"Giacobazzi, R., Debray, S.K., Levi, G.: Generalized semantics and abstract interpretation for constraint logic programs. Journal of Logic Programming\u00a025(3), 191\u2013247 (1995)","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"11_CR43","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01236765","volume":"36","author":"R. Giacobazzi","year":"1996","unstructured":"Giacobazzi, R., Palamidessi, C., Ranzato, F.: Weak relative pseudo-complements of closure operators. Algebra Universalis\u00a036(3), 405\u2013412 (1996)","journal-title":"Algebra Universalis"},{"issue":"1-2","key":"11_CR44","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(97)00006-3","volume":"30","author":"V. Gupta","year":"1998","unstructured":"Gupta, V., Jagadeesan, R., Saraswat, V.: Computing with continuous change. Science of Computer Programming\u00a030(1-2), 3\u201349 (1998)","journal-title":"Science of Computer Programming"},{"key":"11_CR45","volume-title":"Cylindric Algebras (Part I)","author":"L. Henkin","year":"1971","unstructured":"Henkin, L., Monk, J., Tarski, A.: Cylindric Algebras (Part I). North-Holland, Amsterdam (1971)"},{"key":"11_CR46","first-page":"111","volume-title":"Proc. of ACM Symposium on Principles of Programming Languages","author":"J. Jaffar","year":"1987","unstructured":"Jaffar, J., Lassez, J.-L.: Constraint logic programming. In: Proc. of ACM Symposium on Principles of Programming Languages, pp. 111\u2013119. ACM, New York (1987)"},{"key":"11_CR47","series-title":"Series in Logic Programming","first-page":"858","volume-title":"Proc. of the Fourth International Conference on Logic Programming","author":"M.J. Maher","year":"1987","unstructured":"Maher, M.J.: Logic semantics for a class of committed-choice programs. In: Lassez, J.-L. (ed.) Proc. of the Fourth International Conference on Logic Programming, Melbourne. Series in Logic Programming, pp. 858\u2013876. MIT Press, Cambridge (1987)"},{"key":"11_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"11_CR49","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1145\/571157.571173","volume-title":"Proc. of PPDP 2002","author":"M. Nielsen","year":"2002","unstructured":"Nielsen, M., Palamidessi, C., Valencia, F.: On the expressive power of concurrent constraint programming languages. In: Proc. of PPDP 2002, pp. 156\u2013167. ACM Press, New York (2002)"},{"issue":"2","key":"11_CR50","first-page":"145","volume":"9","author":"M. Nielsen","year":"2002","unstructured":"Nielsen, M., Palamidessi, C., Valencia, F.: Temporal concurrent constraint programming: Denotation, logic and applications. Nordic Journal of Computing\u00a09(2), 145\u2013188 (2002)","journal-title":"Nordic Journal of Computing"},{"key":"11_CR51","doi-asserted-by":"crossref","unstructured":"Rueda, C., Alvarez, G., Quesada, L., Tamura, G., Valencia, F., Diaz, J., Assayag, G.: Integrating constraints and concurrent objects in musical applications: A calculus and its visual language. Constraints\u00a06(1) (2001)","DOI":"10.1023\/A:1009849309451"},{"key":"11_CR52","series-title":"Series in Logic Programming","first-page":"1298","volume-title":"Proc. of the Fifth International Conference on Logic Programming","author":"V. Saraswat","year":"1988","unstructured":"Saraswat, V.: A somewhat logical formulation of CLP synchronization primitives. In: Kowalski, R.A., Bowen, K.A. (eds.) Proc. of the Fifth International Conference on Logic Programming, Seattle, USA. Series in Logic Programming, pp. 1298\u20131314. MIT Press, Cambridge (1988)"},{"key":"11_CR53","doi-asserted-by":"crossref","unstructured":"Saraswat, V.: Concurrent Constraint Programming. PhD thesis, Carnegie-Mellon University, January 1989. ACM distinguished dissertation series. The MIT Press, Cambridge (1993)","DOI":"10.7551\/mitpress\/2086.001.0001"},{"key":"11_CR54","first-page":"71","volume-title":"LICS","author":"V. Saraswat","year":"1994","unstructured":"Saraswat, V., Jagadeesan, R., Gupta, V.: Foundations of timed concurrent constraint programming. In: LICS, pp. 71\u201380. IEEE Computer Society, Los Alamitos (1994)"},{"issue":"5\/6","key":"11_CR55","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1006\/jsco.1996.0064","volume":"22","author":"V. Saraswat","year":"1996","unstructured":"Saraswat, V., Jagadeesan, R., Gupta, V.: Timed default concurrent constraint programming. J. Symb. Comput.\u00a022(5\/6), 475\u2013520 (1996)","journal-title":"J. Symb. Comput."},{"key":"11_CR56","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/978-3-540-24580-3_23","volume-title":"Progress in Artificial Intelligence","author":"V. Saraswat","year":"2003","unstructured":"Saraswat, V., Jagadeesan, R., Gupta, V.: jcc: Integrating timed default concurrent constraint programming into java. In: Pires, F.M., Abreu, S.P. (eds.) EPIA 2003. LNCS (LNAI), vol.\u00a02902, pp. 156\u2013170. Springer, Heidelberg (2003)"},{"key":"11_CR57","first-page":"232","volume-title":"Proc. of the seventeenth ACM Symposium on Principles of Programming Languages","author":"V. Saraswat","year":"1990","unstructured":"Saraswat, V., Rinard, M.: Concurrent constraint programming. In: Proc. of the seventeenth ACM Symposium on Principles of Programming Languages, pp. 232\u2013245. ACM, New York (1990)"},{"key":"11_CR58","volume-title":"Proc. of the eighteenth ACM Symposium on Principles of Programming Languages","author":"V. Saraswat","year":"1991","unstructured":"Saraswat, V., Rinard, M., Panangaden, P.: Semantics foundations of Concurrent Constraint Programming. In: Proc. of the eighteenth ACM Symposium on Principles of Programming Languages. ACM, New York (1991)"},{"key":"11_CR59","unstructured":"Shapiro, E.: A subset of Concurrent Prolog and its interpreter. Technical Report TR-003, Institute for New Generation Computer Technology (ICOT), Tokyo (1983)"},{"issue":"8","key":"11_CR60","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/MC.1986.1663307","volume":"19","author":"E. Shapiro","year":"1986","unstructured":"Shapiro, E.: Concurrent Prolog: A progress report. Computer\u00a019(8), 44\u201358 (1986)","journal-title":"Computer"},{"key":"11_CR61","unstructured":"Tamaki, H., Sato, T.: Unfold\/fold transformation of logic programs. In: ICLP, pp. 127\u2013138 (1984)"},{"key":"11_CR62","series-title":"Series in Logic Programming","volume-title":"Concurrent Prolog: Collected Papers","author":"K. Ueda","year":"1987","unstructured":"Ueda, K.: Guarded Horn Clauses. In: Shapiro, E. (ed.) Concurrent Prolog: Collected Papers. Series in Logic Programming. MIT Press, Cambridge (1987)"},{"key":"11_CR63","first-page":"441","volume-title":"Programming of Future Generation Computers","author":"K. Ueda","year":"1988","unstructured":"Ueda, K.: Guarded Horn Clauses, a parallel logic programming language with the concept of a guard. In: Nivat, M., Fuchi, K. (eds.) Programming of Future Generation Computers, pp. 441\u2013456. North Holland, Amsterdam (1988)"},{"key":"11_CR64","unstructured":"Ueda, K., Furukawa, K.: Transformation rules for ghc programs. In: FGCS, pp. 582\u2013591 (1988)"},{"key":"11_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11799573_47","volume-title":"Logic Programming","author":"K. Ueda","year":"2006","unstructured":"Ueda, K., Kato, N., Hara, K., Mizuno, K.: LMNtal as a unifying declarative language: Live demonstration. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 457\u2013458. Springer, Heidelberg (2006)"},{"key":"11_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/3-540-60299-2_22","volume-title":"Principles and Practice of Constraint Programming - CP \u201995","author":"E. Zaffanella","year":"1995","unstructured":"Zaffanella, E.: Domain Independent Ask Approximation in CCP. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol.\u00a0976, pp. 362\u2013379. Springer, Heidelberg (1995)"},{"key":"11_CR67","unstructured":"Zaffanella, E., Giacobazzi, R., Levi, G.: Abstracting synchronization in concurrent constraint programming. Journal of Functional and Logic Programming\u00a01997(6) (November 1997)"}],"container-title":["Lecture Notes in Computer Science","A 25-Year Perspective on Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14309-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:50:58Z","timestamp":1606186258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14309-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143083","9783642143090"],"references-count":68,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14309-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}