{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:23:49Z","timestamp":1726057429878},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030311742"},{"type":"electronic","value":"9783030311759"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-31175-9_14","type":"book-chapter","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T15:18:17Z","timestamp":1572967097000},"page":"241-257","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Polyadic Soft Constraints"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura","family":"Bussi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Santini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,4]]},"reference":[{"key":"14_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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-19805-2_10"},{"issue":"2","key":"14_CR2","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"},{"key":"14_CR3","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)"},{"issue":"3","key":"14_CR4","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. Logic 7(3), 563\u2013589 (2006)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"2","key":"14_CR5","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."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3-540-53982-4_17","volume-title":"TAPSOFT \u201991","author":"FS Boer de","year":"1991","unstructured":"de Boer, F.S., Palamidessi, C.: A fully abstract model for concurrent constraint programming. In: Abramsky, S., Maibaum, T.S.E. (eds.) CAAP 1991. LNCS, vol. 493, pp. 296\u2013319. Springer, Heidelberg (1991). \n                      https:\/\/doi.org\/10.1007\/3-540-53982-4_17"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-25527-9_13","volume-title":"Programming Languages with Applications to Biology and Security","author":"D Chiarugi","year":"2015","unstructured":"Chiarugi, D., Falaschi, M., Olarte, C., Palamidessi, C.: A declarative view of signaling pathways. In: Bodei, C., Ferrari, G.-L., Priami, C. (eds.) Programming Languages with Applications to Biology and Security. LNCS, vol. 9465, pp. 183\u2013201. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-25527-9_13"},{"issue":"5","key":"14_CR8","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/265943.265954","volume":"19","author":"FS Boer De","year":"1997","unstructured":"De Boer, F.S., Gabbrielli, M., Marchiori, E., Palamidessi, C.: Proving concurrent constraint programs correct. ACM Trans. Program. Lang. Syst. 19(5), 685\u2013725 (1997)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1006\/inco.2000.3002","volume":"165","author":"F Fages","year":"2001","unstructured":"Fages, F., Ruet, P., Soliman, S.: Linear concurrent constraint programming: operational and phase semantics. Inf. Comput. 165(1), 14\u201341 (2001)","journal-title":"Inf. Comput."},{"key":"14_CR10","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":"14_CR11","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. Logical Algebraic Methods Program. 92, 45\u201363 (2017)","journal-title":"Logical Algebraic Methods Program."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Golan, J.: Semirings and Affine Equations over Them. Kluwer (2003)","DOI":"10.1007\/978-94-017-0383-3"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-32940-1_23","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"S Knight","year":"2012","unstructured":"Knight, S., Palamidessi, C., Panangaden, P., Valencia, F.D.: Spatial and epistemic modalities in constraint-based process calculi. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 317\u2013332. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-32940-1_23"},{"issue":"1","key":"14_CR14","first-page":"32","volume":"13","author":"V Kumar","year":"1992","unstructured":"Kumar, V.: Algorithms for constraint-satisfaction problems: a survey. AI Mag. 13(1), 32\u201344 (1992)","journal-title":"AI Mag."},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/11799573_43","volume-title":"Logic Programming","author":"HA L\u00f3pez","year":"2006","unstructured":"L\u00f3pez, H.A., Palamidessi, C., P\u00e9rez, J.A., Rueda, C., Valencia, F.D.: A declarative framework for security: secure concurrent constraint programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 449\u2013450. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11799573_43"},{"issue":"1","key":"14_CR16","first-page":"145","volume":"9","author":"M Nielsen","year":"2002","unstructured":"Nielsen, M., Palamidessi, C., Valencia, F.D.: Temporal concurrent constraint programming: denotation, logic and applications. Nordic J. Comput. 9(1), 145\u2013188 (2002)","journal-title":"Nordic J. Comput."},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-45578-7_21","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 2001","author":"C Palamidessi","year":"2001","unstructured":"Palamidessi, C., Valencia, F.D.: A temporal concurrent constraint programming calculus. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 302\u2013316. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-45578-7_21"},{"key":"14_CR18","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-35025-2_18"},{"key":"14_CR19","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)","DOI":"10.1145\/99583.99627"},{"issue":"4","key":"14_CR20","doi-asserted-by":"publisher","first-page":"45:1","DOI":"10.1145\/1597036.1597049","volume":"5","author":"AD Scott","year":"2009","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)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Lecture Notes in Computer Science","The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31175-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T15:50:00Z","timestamp":1572969000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31175-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030311742","9783030311759"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31175-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}