{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:42:27Z","timestamp":1743090147349,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031081453"},{"type":"electronic","value":"9783031081439"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08143-9_10","type":"book-chapter","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T13:06:32Z","timestamp":1655125592000},"page":"159-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Soft Concurrent Constraint Programming with\u00a0Local Variables"],"prefix":"10.1007","author":[{"given":"Laura","family":"Bussi","sequence":"first","affiliation":[]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Santini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,14]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-19805-2_10","volume-title":"Foundations of Software Science and Computational Structures","author":"A Aristiz\u00e1bal","year":"2011","unstructured":"Aristiz\u00e1bal, A., Bonchi, F., Palamidessi, C., Pino, L., Valencia, F.: Deriving labels and bisimilarity for concurrent constraint programming. In: Hofmann, M. (ed.) FoSSaCS 2011. LNCS, vol. 6604, pp. 138\u2013152. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19805-2_10"},{"doi-asserted-by":"crossref","unstructured":"Bengtson, J., Johansson, M., Parrow, J., Victor, B.: Psi-calculi: mobile processes, nominal data, and logic. In: LICS 2009, pp. 39\u201348. IEEE Computer Society (2009)","key":"10_CR2","DOI":"10.1109\/LICS.2009.20"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/256303.256306","volume":"44","author":"S Bistarelli","year":"1997","unstructured":"Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. J. ACM 44(2), 201\u2013236 (1997)","journal-title":"J. ACM"},{"unstructured":"Bistarelli, S., Gadducci, F.: Enhancing constraints manipulation in semiring-based formalisms. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI 2006. FAIA, vol. 141, pp. 63\u201367. IOS Press (2006)","key":"10_CR4"},{"issue":"3","key":"10_CR5","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. 7(3), 563\u2013589 (2006)","journal-title":"ACM Trans. Comput. Log."},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1080\/09528130903010212","volume":"22","author":"S Bistarelli","year":"2010","unstructured":"Bistarelli, S., Pini, M.S., Rossi, F., Venable, K.B.: From soft constraints to bipolar preferences: modelling framework and solving issues. Exp. Theor. Artif. Intell. 22(2), 135\u2013158 (2010)","journal-title":"Exp. Theor. Artif. Intell."},{"issue":"3","key":"10_CR7","first-page":"257","volume":"111","author":"S Bistarelli","year":"2011","unstructured":"Bistarelli, S., Santini, F.: A nonmonotonic soft concurrent constraint language to model the negotiation process. Fund. Inform. 111(3), 257\u2013279 (2011)","journal-title":"Fund. Inform."},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-030-31175-9_14","volume-title":"The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy","author":"F Bonchi","year":"2019","unstructured":"Bonchi, F., Bussi, L., Gadducci, F., Santini, F.: Polyadic soft constraints. In: Alvim, M.S., Chatzikokolakis, K., Olarte, C., Valencia, F. (eds.) The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy. LNCS, vol. 11760, pp. 241\u2013257. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31175-9_14"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10817-010-9196-8","volume":"48","author":"C Borralleras","year":"2012","unstructured":"Borralleras, C., Lucas, S., Oliveras, A., Rodr\u00edguez-Carbonell, E., Rubio, A.: SAT modulo linear arithmetic for solving polynomial constraints. J. Automed Reasoning 48(1), 107\u2013131 (2012)","journal-title":"J. Automed Reasoning"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/11562931_13","volume-title":"Logic Programming","author":"L Bortolussi","year":"2005","unstructured":"Bortolussi, L., Wiklicky, H.: A distributed and probabilistic concurrent constraint programming language. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 143\u2013158. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11562931_13"},{"unstructured":"Brim, L., Kret\u00ednsk\u00fd, M., Jacquet, J., Gilbert, D.R.: Modelling multi-agent systems as synchronous concurrent constraint processes. Comput. Artif. Intell. 21(6) (2002)","key":"10_CR11"},{"key":"10_CR12","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":"MG Buscemi","year":"2008","unstructured":"Buscemi, M.G., Montanari, U.: Open bisimulation for the concurrent constraint pi-calculus. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol. 4960, pp. 254\u2013268. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78739-6_20"},{"doi-asserted-by":"crossref","unstructured":"D\u00edaz, J.F., Rueda, C., Valencia, F.D.: Pi+- calculus: a calculus for concurrent processes with constraints. CLEI Electron. J. 1(2) (1998)","key":"10_CR13","DOI":"10.19153\/cleiej.1.2.2"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.ipl.2016.10.002","volume":"118","author":"F Gadducci","year":"2017","unstructured":"Gadducci, F., Santini, F.: Residuation for bipolar preferences in soft constraints. Inf. Process. Lett. 118, 69\u201374 (2017)","journal-title":"Inf. Process. Lett."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.jlamp.2017.06.001","volume":"92","author":"F Gadducci","year":"2017","unstructured":"Gadducci, F., Santini, F., Pino, L.F., Valencia, F.D.: Observational and behavioural equivalences for soft concurrent constraint programming. J. Log. Algebraic Methods Program. 92, 45\u201363 (2017)","journal-title":"J. Log. Algebraic Methods Program."},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1090\/S0002-9939-1957-0086031-7","volume":"8","author":"BA Galler","year":"1957","unstructured":"Galler, B.A.: Cylindric and polyadic algebras. Proc. Am. Math. Soc. 8(1), 176\u2013183 (1957)","journal-title":"Proc. Am. Math. Soc."},{"unstructured":"Giacobazzi, R., Debray, S.K., Levi, G.: A generalized semantics for constraint logic programs. In: FGCS 1992, pp. 581\u2013591. IOS Press (1992)","key":"10_CR17"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/3-540-44957-4_31","volume-title":"Computational Logic \u2014 CL 2000","author":"D Gilbert","year":"2000","unstructured":"Gilbert, D., Palamidessi, C.: Concurrent constraint programming with process mobility. In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 463\u2013477. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44957-4_31"},{"doi-asserted-by":"crossref","unstructured":"Golan, J.: Semirings and Affine Equations over Them. Kluwer (2003)","key":"10_CR19","DOI":"10.1007\/978-94-017-0383-3"},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.jlamp.2016.09.001","volume":"86","author":"M Guzm\u00e1n","year":"2017","unstructured":"Guzm\u00e1n, M., Haar, S., Perchy, S., Rueda, C., Valencia, F.D.: Belief, knowledge, lies and other utterances in an algebra for space and extrusion. J. Log. Algebraic Methods Program. 86(1), 107\u2013133 (2017)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685\u2013695. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_114"},{"issue":"4","key":"10_CR22","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/s10601-013-9145-3","volume":"18","author":"C Olarte","year":"2013","unstructured":"Olarte, C., Rueda, C., Valencia, F.D.: Models and emerging trends of concurrent constraint programming. Constraints 18(4), 535\u2013578 (2013)","journal-title":"Constraints"},{"issue":"3","key":"10_CR23","first-page":"323","volume":"34","author":"J R\u00e9ty","year":"1998","unstructured":"R\u00e9ty, J.: Distributed concurrent constraint programming. Fund. Inform. 34(3), 323\u2013346 (1998)","journal-title":"Fund. Inform."},{"key":"10_CR24","series-title":"Bolyai Society Mathematical Studies","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-642-35025-2_18","volume-title":"Cylindric-like Algebras and Algebraic Logic","author":"G S\u00e1gi","year":"2013","unstructured":"S\u00e1gi, G.: Polyadic algebras. In: Andr\u00e9ka, H., Ferenczi, M., N\u00e9meti, I. (eds.) Cylindric-like Algebras and Algebraic Logic. BSMS, vol. 22, pp. 367\u2013389. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35025-2_18"},{"doi-asserted-by":"crossref","unstructured":"Saraswat, V.A., Rinard, M.C., Panangaden, P.: Semantic foundations of concurrent constraint programming. In: Wise, D.S. (ed.) POPL 1991, pp. 333\u2013352. ACM Press (1991)","key":"10_CR25","DOI":"10.1145\/99583.99627"},{"doi-asserted-by":"crossref","unstructured":"Scott, A.D., Sorkin, G.B.: Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function. ACM Trans. Algorithms 5(4), 45:1\u201345:27 (2009)","key":"10_CR26","DOI":"10.1145\/1597036.1597049"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08143-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T13:07:23Z","timestamp":1655125643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08143-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031081453","9783031081439"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08143-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"14 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COORDINATION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Coordination Languages and Models","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lucca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coordination2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}