{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:45:02Z","timestamp":1778215502896,"version":"3.51.4"},"reference-count":25,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T00:00:00Z","timestamp":1405900800000},"content-version":"unspecified","delay-in-days":20,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2014,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Concurrent Constraint Programming (CCP) is a simple and powerful model for\n                    concurrency where agents interact by telling and asking constraints. Since their\n                    inception, CCP-languages have been designed for having a strong connection to\n                    logic. In fact, the underlying constraint system can be built from a suitable\n                    fragment of intuitionistic (linear) logic -ILL- and processes can be interpreted\n                    as formulas in ILL. Constraints as ILL formulas fail to represent accurately\n                    situations where \u201cpreferences\u201d (called soft constraints)\n                    such as probabilities, uncertainty or fuzziness are present. In order to\n                    circumvent this problem, c-semirings have been proposed as algebraic structures\n                    for defining constraint systems where agents are allowed to tell and ask soft\n                    constraints. Nevertheless, in this case, the tight connection to logic and proof\n                    theory is lost. In this work, we give a proof theoretical meaning to soft\n                    constraints: they can be defined as formulas in a suitable fragment of ILL with\n                    subexponentials (SELL) where subexponentials, ordered in a c-semiring structure,\n                    are interpreted as preferences. We hence achieve two goals: (1) obtain a CCP\n                    language where agents can tell and ask soft constraints and (2) prove that the\n                    language in (1) has a strong connection with logic. Hence we keep a declarative\n                    reading of processes as formulas while providing a logical framework for\n                    soft-CCP based systems. An interesting side effect of (1) is that one is also\n                    able to handle probabilities (and other modalities) in SELL, by restricting the\n                    use of the promotion rule for non-idempotent c-semirings.This finer way of\n                    controlling subexponentials allows for considering more interesting spaces and\n                    restrictions, and it opens the possibility of specifying more challenging\n                    computational systems.<\/jats:p>","DOI":"10.1017\/s147106841400026x","type":"journal-article","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T11:52:50Z","timestamp":1405943570000},"page":"649-663","source":"Crossref","is-referenced-by-count":7,"title":["A Proof Theoretic Study of Soft Concurrent Constraint Programming"],"prefix":"10.1017","volume":"14","author":[{"given":"ELAINE","family":"PIMENTEL","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CARLOS","family":"OLARTE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"VIVEK","family":"NIGAM","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,7,21]]},"reference":[{"key":"S147106841400026X_ref11","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.3002"},{"key":"S147106841400026X_ref24","first-page":"631","volume-title":"IJCAI (1)","author":"Schiex","year":"1995"},{"key":"S147106841400026X_ref2","first-page":"50","volume-title":"COORDINATION","author":"Bistarelli","year":"2008"},{"key":"S147106841400026X_ref9","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2879"},{"key":"S147106841400026X_ref8","first-page":"159","volume-title":"Kurt\n                        G\u00f6del Colloq","author":"Danos","year":"1993"},{"key":"S147106841400026X_ref5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026441215081"},{"key":"S147106841400026X_ref14","first-page":"544","volume-title":"FSTTCS","author":"Haemmerl\u00e9","year":"2007"},{"key":"S147106841400026X_ref7","first-page":"185","volume-title":"CSL","author":"Chaudhuri","year":"2010"},{"key":"S147106841400026X_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00047-Z"},{"key":"S147106841400026X_ref18","volume-title":"LSFA'13","author":"Olarte","year":"2013"},{"key":"S147106841400026X_ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1599410.1599427"},{"key":"S147106841400026X_ref21","volume-title":"Handbook of Constraint\n                    Programming","author":"Rossi","year":"2006"},{"key":"S147106841400026X_ref1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.3.297"},{"key":"S147106841400026X_ref6","first-page":"351","volume-title":"ESOP","author":"Brunel","year":"2014"},{"key":"S147106841400026X_ref12","unstructured":"Ghica D. R. and Smith A. 2013. From bounded affine types to automatic timing analysis. CoRR abs\/1307.2473."},{"key":"S147106841400026X_ref3","doi-asserted-by":"publisher","DOI":"10.1145\/256303.256306"},{"key":"S147106841400026X_ref17","first-page":"410","volume-title":"CONCUR","author":"Nigam","year":"2013"},{"key":"S147106841400026X_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-013-9145-3"},{"key":"S147106841400026X_ref22","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0064"},{"key":"S147106841400026X_ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149118"},{"key":"S147106841400026X_ref23","first-page":"333","volume-title":"POPL","author":"Saraswat","year":"1991"},{"key":"S147106841400026X_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"S147106841400026X_ref15","first-page":"317","volume-title":"CONCUR","author":"Knight","year":"2012"},{"key":"S147106841400026X_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-006-6347-5"},{"key":"S147106841400026X_ref20","unstructured":"Pimentel E. , Olarte C. , and Nigam V. 2013. A Proof Theoretic Study of Soft CCP. CoRR abs\/1405.2329, http:\/\/arxiv.org\/abs\/1405.2329."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S147106841400026X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T19:05:05Z","timestamp":1555959905000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S147106841400026X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":25,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["S147106841400026X"],"URL":"https:\/\/doi.org\/10.1017\/s147106841400026x","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7]]}}}