Subexponential concurrent constraint programming
In previous works we have shown that linear logic with subexponentials (SELL), a refinement of linear logic, can be used to specify emergent features of concurrent constraint programming (CCP) languages, such as preferences and spatial, epistemic and temporal modalities. In order to do so, we introd...
Saved in:
| Published in: | Theoretical computer science Vol. 606; pp. 98 - 120 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
16.11.2015
|
| Subjects: | |
| ISSN: | 0304-3975, 1879-2294 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In previous works we have shown that linear logic with subexponentials (SELL), a refinement of linear logic, can be used to specify emergent features of concurrent constraint programming (CCP) languages, such as preferences and spatial, epistemic and temporal modalities. In order to do so, we introduced a number of extensions to SELL, such as subexponential quantifiers for the specification of modalities, and more elaborated subexponential structures for the specification of preferences. These results provided clear proof theoretic foundations to existing systems. This paper goes in the opposite direction, answering positively the question: can the proof theory of linear logic with subexponentials contribute to the development of new CCP languages? We propose a CCP language with the following powerful features: 1) computational spaces where agents can tell and ask preferences (soft-constraints); 2) systems where spatial and temporal modalities can be combined; 3) shared spaces for communication that can be dynamically established; and 4) systems that can dynamically create nested spaces. In order to provide the proof theoretic foundations for such a language, we propose a unified logical framework (SELLS⋒) combining the extensions of linear logic with subexponentials mentioned above, and showing that this new framework has interesting proof theoretical properties such as cut-elimination and a sound and complete focused proof system. |
|---|---|
| AbstractList | In previous works we have shown that linear logic with subexponentials (SELL), a refinement of linear logic, can be used to specify emergent features of concurrent constraint programming (CCP) languages, such as preferences and spatial, epistemic and temporal modalities. In order to do so, we introduced a number of extensions to SELL, such as subexponential quantifiers for the specification of modalities, and more elaborated subexponential structures for the specification of preferences. These results provided clear proof theoretic foundations to existing systems. This paper goes in the opposite direction, answering positively the question: can the proof theory of linear logic with subexponentials contribute to the development of new CCP languages? We propose a CCP language with the following powerful features: 1) computational spaces where agents can tell and ask preferences (soft-constraints); 2) systems where spatial and temporal modalities can be combined; 3) shared spaces for communication that can be dynamically established; and 4) systems that can dynamically create nested spaces. In order to provide the proof theoretic foundations for such a language, we propose a unified logical framework (SELLS⋒) combining the extensions of linear logic with subexponentials mentioned above, and showing that this new framework has interesting proof theoretical properties such as cut-elimination and a sound and complete focused proof system. In previous works we have shown that linear logic with subexponentials (SELL), a refinement of linear logic, can be used to specify emergent features of concurrent constraint programming (CCP) languages, such as preferences and spatial, epistemic and temporal modalities. In order to do so, we introduced a number of extensions to SELL, such as subexponential quantifiers for the specification of modalities, and more elaborated subexponential structures for the specification of preferences. These results provided clear proof theoretic foundations to existing systems. This paper goes in the opposite direction, answering positively the question: can the proof theory of linear logic with subexponentials contribute to the development of new CCP languages? We propose a CCP language with the following powerful features: 1) computational spaces where agents can tell and ask preferences (soft-constraints); 2) systems where spatial and temporal modalities can be combined; 3) shared spaces for communication that can be dynamically established; and 4) systems that can dynamically create nested spaces. In order to provide the proof theoretic foundations for such a language, we propose a unified logical framework () combining the extensions of linear logic with subexponentials mentioned above, and showing that this new framework has interesting proof theoretical properties such as cut-elimination and a sound and complete focused proof system. |
| Author | Olarte, Carlos Nigam, Vivek Pimentel, Elaine |
| Author_xml | – sequence: 1 givenname: Carlos surname: Olarte fullname: Olarte, Carlos email: carlos.olarte@gmail.com organization: Universidade Federal do Rio Grande do Norte, Natal, Brazil – sequence: 2 givenname: Elaine surname: Pimentel fullname: Pimentel, Elaine email: elaine.pimentel@gmail.com organization: Universidade Federal do Rio Grande do Norte, Natal, Brazil – sequence: 3 givenname: Vivek surname: Nigam fullname: Nigam, Vivek email: vivek.nigam@gmail.com organization: Universidade Federal da Paraíba, João Pessoa, Brazil |
| BookMark | eNp9kE1PwzAMhiM0JMbgB3DjyKXFadqkFSc08SVN4sDuUZo6U6Y2HUmK4N-Tapw4zBfbsp_X8ntJFm50SMgNhZwC5ff7POqQF0CrHHgOjJ6RJa1FkxVFUy7IEhiUGWtEdUEuQ9hDikrwJYGPqcXvQxJz0ar-Vo9OT96nbi5D9Mqm8uDHnVfDYN3uipwb1Qe8_ssrsn1-2q5fs837y9v6cZNpJljMuKGgy6JV2CgualSqKmhZMlNCXXQlByXQGMSKUtbxqjVp0IJpOTSm61q2IndH2XT6c8IQ5WCDxr5XDscpSCpEDQVnok6r9Liq_RiCRyMP3g7K_0gKcjZH7mUyR87mSOAymZMY8Y_RNqpoRzd_3J8kH44kpue_LHoZtEWnsbMedZTdaE_Qv4fKgg0 |
| CitedBy_id | crossref_primary_10_1016_j_entcs_2017_04_007 crossref_primary_10_1016_j_tcs_2016_03_029 crossref_primary_10_1016_j_apal_2024_103509 crossref_primary_10_1017_S0960129518000117 crossref_primary_10_1016_j_entcs_2018_10_014 crossref_primary_10_1016_j_tcs_2017_06_009 crossref_primary_10_1016_j_tcs_2016_08_026 crossref_primary_10_1017_S1471068421000533 crossref_primary_10_1017_S0960129518000439 |
| Cites_doi | 10.1016/0304-3975(87)90045-4 10.1016/0890-5401(92)90008-4 10.1006/inco.2000.3002 10.1145/1149114.1149118 10.1016/j.entcs.2014.06.008 10.1007/s10732-006-6347-5 10.1007/s10601-013-9145-3 10.1017/S1471068411000123 10.1145/383721.383725 10.1017/S147106841400026X 10.1006/jsco.1996.0064 10.3233/JCS-2004-12203 10.1023/A:1026441215081 10.1093/logcom/2.3.297 10.1016/j.entcs.2011.03.009 10.1145/256303.256306 10.1016/S0743-1066(98)10006-7 10.1007/s10817-010-9182-1 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier B.V. |
| Copyright_xml | – notice: 2015 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.tcs.2015.06.031 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 120 |
| ExternalDocumentID | 10_1016_j_tcs_2015_06_031 S0304397515005411 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c373t-6f10c42bae9a678eaa521443f4082d460a7effee5113d65bff40b0fb609fddb3 |
| ISICitedReferencesCount | 13 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000366777000007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sun Sep 28 10:32:56 EDT 2025 Sat Nov 29 05:15:20 EST 2025 Tue Nov 18 22:26:11 EST 2025 Fri Feb 23 02:30:22 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Concurrent constraint programming Linear logic Proof systems |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c373t-6f10c42bae9a678eaa521443f4082d460a7effee5113d65bff40b0fb609fddb3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2015.06.031 |
| PQID | 1778026378 |
| PQPubID | 23500 |
| PageCount | 23 |
| ParticipantIDs | proquest_miscellaneous_1778026378 crossref_primary_10_1016_j_tcs_2015_06_031 crossref_citationtrail_10_1016_j_tcs_2015_06_031 elsevier_sciencedirect_doi_10_1016_j_tcs_2015_06_031 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-11-16 |
| PublicationDateYYYYMMDD | 2015-11-16 |
| PublicationDate_xml | – month: 11 year: 2015 text: 2015-11-16 day: 16 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Durgin, Lincoln, Mitchell (br0330) 2004; 12 Fages, Ruet, Soliman (br0100) 2001; 165 Hentenryck, Saraswat, Deville (br0200) 1998; 37 Pimentel, Olarte, Nigam (br0080) 2014; 14 Haemmerlé, Fages, Soliman (br0290) 2007; vol. 4855 Milner, Parrow, Walker (br0180) 1992; 100 (br0220) 2006; vol. 2 Miller, Saurin (br0160) 2007; vol. 4646 Nielsen, Palamidessi, Valencia (br0190) 2002; 9 Schiex, Fargier, Verfaillie (br0240) 1995 Schneier (br0380) 2008 Reed (br0370) 2009 Olarte, Rueda, Valencia (br0170) 2013; 18 Chiarugi, Hemith, Falaschi, Olarte (br0280) 2014 Fargier, Lang (br0260) 1993; vol. 747 Troelstra (br0390) 1992 Nigam, Miller (br0050) 2009 Nigam, Olarte, Pimentel (br0010) 2013; vol. 8052 Danos, Joinet, Schellinx (br0040) 1993; vol. 713 Saraswat, Rinard, Panangaden (br0020) 1991 Wilson (br0340) 2006; 12 Saraswat (br0210) 1993 Nigam, Miller (br0060) 2010; 45 Bistarelli, Montanari, Rossi, Schiex, Verfaillie, Fargier (br0250) 1999; 4 Saraswat, Jagadeesan, Gupta (br0270) 1996; 22 Knight, Palamidessi, Panangaden, Valencia (br0030) 2012; vol. 7454 Hildebrandt, López (br0320) 2009; vol. 5649 Andreoli (br0120) 1992; 2 Cervesato, Pfenning, Walker, Watkins (br0150) 2003 Bistarelli, Montanari, Rossi (br0110) 2006; 7 Ghica, Smith (br0350) Bistarelli, Montanari, Rossi (br0230) 1997; 44 Olarte, Valencia (br0300) 2008 Brunel, Gaboardi, Mazza, Zdancewic (br0360) 2014; vol. 8410 Haemmerlé (br0310) 2011; 11 Bistarelli, Montanari, Rossi (br0090) 2001; 23 Nigam, Pimentel, Reis (br0140) 2011; 269 Olarte, Nigam, Pimentel (br0070) 2014; 305 Girard (br0130) 1987; 50 Olarte (10.1016/j.tcs.2015.06.031_br0300) 2008 Bistarelli (10.1016/j.tcs.2015.06.031_br0110) 2006; 7 Chiarugi (10.1016/j.tcs.2015.06.031_br0280) 2014 Olarte (10.1016/j.tcs.2015.06.031_br0170) 2013; 18 Danos (10.1016/j.tcs.2015.06.031_br0040) 1993; vol. 713 Girard (10.1016/j.tcs.2015.06.031_br0130) 1987; 50 Nigam (10.1016/j.tcs.2015.06.031_br0060) 2010; 45 Knight (10.1016/j.tcs.2015.06.031_br0030) 2012; vol. 7454 Olarte (10.1016/j.tcs.2015.06.031_br0070) 2014; 305 Bistarelli (10.1016/j.tcs.2015.06.031_br0230) 1997; 44 Wilson (10.1016/j.tcs.2015.06.031_br0340) 2006; 12 Nigam (10.1016/j.tcs.2015.06.031_br0050) 2009 Nigam (10.1016/j.tcs.2015.06.031_br0140) 2011; 269 Haemmerlé (10.1016/j.tcs.2015.06.031_br0310) 2011; 11 Nielsen (10.1016/j.tcs.2015.06.031_br0190) 2002; 9 Bistarelli (10.1016/j.tcs.2015.06.031_br0250) 1999; 4 Pimentel (10.1016/j.tcs.2015.06.031_br0080) 2014; 14 Brunel (10.1016/j.tcs.2015.06.031_br0360) 2014; vol. 8410 Saraswat (10.1016/j.tcs.2015.06.031_br0210) 1993 Hildebrandt (10.1016/j.tcs.2015.06.031_br0320) 2009; vol. 5649 Ghica (10.1016/j.tcs.2015.06.031_br0350) Schneier (10.1016/j.tcs.2015.06.031_br0380) 2008 Troelstra (10.1016/j.tcs.2015.06.031_br0390) 1992 Saraswat (10.1016/j.tcs.2015.06.031_br0270) 1996; 22 Saraswat (10.1016/j.tcs.2015.06.031_br0020) 1991 Milner (10.1016/j.tcs.2015.06.031_br0180) 1992; 100 Hentenryck (10.1016/j.tcs.2015.06.031_br0200) 1998; 37 Fargier (10.1016/j.tcs.2015.06.031_br0260) 1993; vol. 747 (10.1016/j.tcs.2015.06.031_br0220) 2006; vol. 2 Andreoli (10.1016/j.tcs.2015.06.031_br0120) 1992; 2 Haemmerlé (10.1016/j.tcs.2015.06.031_br0290) 2007; vol. 4855 Bistarelli (10.1016/j.tcs.2015.06.031_br0090) 2001; 23 Schiex (10.1016/j.tcs.2015.06.031_br0240) 1995 Cervesato (10.1016/j.tcs.2015.06.031_br0150) 2003 Miller (10.1016/j.tcs.2015.06.031_br0160) 2007; vol. 4646 Reed (10.1016/j.tcs.2015.06.031_br0370) 2009 Durgin (10.1016/j.tcs.2015.06.031_br0330) 2004; 12 Fages (10.1016/j.tcs.2015.06.031_br0100) 2001; 165 Nigam (10.1016/j.tcs.2015.06.031_br0010) 2013; vol. 8052 |
| References_xml | – volume: 22 start-page: 475 year: 1996 end-page: 520 ident: br0270 article-title: Timed default concurrent constraint programming publication-title: J. Symbolic Comput. – volume: 14 start-page: 649 year: 2014 end-page: 663 ident: br0080 article-title: A proof theoretic study of soft concurrent constraint programming publication-title: Theory Pract. Log. Program. – volume: 165 start-page: 14 year: 2001 end-page: 41 ident: br0100 article-title: Linear concurrent constraint programming: operational and phase semantics publication-title: Inform. and Comput. – ident: br0350 article-title: From bounded affine types to automatic timing analysis – volume: 9 start-page: 145 year: 2002 end-page: 188 ident: br0190 article-title: Temporal concurrent constraint programming: denotation, logic and applications publication-title: Nordic J. Comput. – volume: vol. 713 start-page: 159 year: 1993 end-page: 171 ident: br0040 article-title: The structure of exponentials: uncovering the dynamics of linear logic proofs publication-title: Kurt Gödel Colloquium – year: 2014 ident: br0280 article-title: Verification of spatial and temporal modalities in biochemical systems publication-title: Proc. of the Fifth International Workshop on Static Analysis and Systems Biology – volume: 18 start-page: 535 year: 2013 end-page: 578 ident: br0170 article-title: Models and emerging trends of concurrent constraint programming publication-title: Constraints – volume: 269 start-page: 109 year: 2011 end-page: 123 ident: br0140 article-title: Specifying proof systems in linear logic with subexponentials publication-title: Electron. Notes Theor. Comput. Sci. – start-page: 631 year: 1995 end-page: 639 ident: br0240 article-title: Valued constraint satisfaction problems: hard and easy problems publication-title: IJCAI (1) – volume: vol. 4855 start-page: 544 year: 2007 end-page: 556 ident: br0290 article-title: Closures and modules within linear logic concurrent constraint programming publication-title: FSTTCS – volume: 23 start-page: 1 year: 2001 end-page: 29 ident: br0090 article-title: Semiring-based constraint logic programming: syntax and semantics publication-title: ACM Trans. Program. Lang. Syst. – volume: 7 start-page: 563 year: 2006 end-page: 589 ident: br0110 article-title: Soft concurrent constraint programming publication-title: ACM Trans. Comput. Log. – year: 2008 ident: br0380 article-title: Schneier on Security – start-page: 129 year: 2009 end-page: 140 ident: br0050 article-title: Algorithmic specifications in linear logic with subexponentials publication-title: PPDP – volume: 4 start-page: 199 year: 1999 end-page: 240 ident: br0250 article-title: Semiring-based CSPs and valued CSPs: frameworks, properties, and comparison publication-title: Constraints – volume: 50 start-page: 1 year: 1987 end-page: 102 ident: br0130 article-title: Linear logic publication-title: Theoret. Comput. Sci. – volume: vol. 5649 start-page: 417 year: 2009 end-page: 431 ident: br0320 article-title: Types for secure pattern matching with local knowledge in universal concurrent constraint programming publication-title: ICLP – volume: vol. 2 year: 2006 ident: br0220 publication-title: Handbook of Constraint Programming – volume: 2 start-page: 297 year: 1992 end-page: 347 ident: br0120 article-title: Logic programming with focusing proofs in linear logic publication-title: J. Logic Comput. – start-page: 145 year: 2008 end-page: 150 ident: br0300 article-title: Universal concurrent constraint programing: symbolic semantics and applications to security publication-title: SAC – volume: 11 start-page: 469 year: 2011 end-page: 485 ident: br0310 article-title: Observational equivalences for linear logic concurrent constraint languages publication-title: Theory Pract. Log. Program. – volume: vol. 8410 start-page: 351 year: 2014 end-page: 370 ident: br0360 article-title: A core quantitative coeffect calculus publication-title: ESOP – year: 1992 ident: br0390 article-title: Lectures on Linear Logic publication-title: CSLI Lecture Notes – volume: 305 start-page: 103 year: 2014 end-page: 121 ident: br0070 article-title: Dynamic spaces in concurrent constraint programming publication-title: Electron. Notes Theor. Comput. Sci. – volume: 12 start-page: 247 year: 2004 end-page: 311 ident: br0330 article-title: Multiset rewriting and the complexity of bounded security protocols publication-title: J. Comput. Secur. – volume: 12 start-page: 241 year: 2006 end-page: 262 ident: br0340 article-title: A logic of soft constraints based on partially ordered preferences publication-title: J. Heuristics – year: 1993 ident: br0210 article-title: Concurrent Constraint Programming – start-page: 333 year: 1991 end-page: 352 ident: br0020 article-title: Semantic foundations of concurrent constraint programming publication-title: POPL – year: 2003 ident: br0150 article-title: A concurrent logical framework II: examples and applications – volume: 37 start-page: 139 year: 1998 end-page: 164 ident: br0200 article-title: Design, implementation, and evaluation of the constraint language cc(fd) publication-title: J. Log. Program. – year: 2009 ident: br0370 article-title: A hybrid logical framework – volume: vol. 4646 start-page: 405 year: 2007 end-page: 419 ident: br0160 article-title: From proofs to focused proofs: a modular proof of focalization in linear logic publication-title: CSL – volume: 100 start-page: 1 year: 1992 end-page: 40 ident: br0180 article-title: A calculus of mobile processes, parts I and II publication-title: Inform. and Comput. – volume: vol. 8052 start-page: 410 year: 2013 end-page: 424 ident: br0010 article-title: A general proof system for modalities in concurrent constraint programming publication-title: CONCUR – volume: 44 start-page: 201 year: 1997 end-page: 236 ident: br0230 article-title: Semiring-based constraint satisfaction and optimization publication-title: J. ACM – volume: vol. 747 start-page: 97 year: 1993 end-page: 104 ident: br0260 article-title: Uncertainty in constraint satisfaction problems: a probabilistic approach publication-title: ECSQARU – volume: vol. 7454 start-page: 317 year: 2012 end-page: 332 ident: br0030 article-title: Spatial and epistemic modalities in constraint-based process calculi publication-title: CONCUR – volume: 45 start-page: 157 year: 2010 end-page: 188 ident: br0060 article-title: A framework for proof systems publication-title: J. Automat. Reason. – volume: 50 start-page: 1 year: 1987 ident: 10.1016/j.tcs.2015.06.031_br0130 article-title: Linear logic publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(87)90045-4 – volume: 100 start-page: 1 issue: 1 year: 1992 ident: 10.1016/j.tcs.2015.06.031_br0180 article-title: A calculus of mobile processes, parts I and II publication-title: Inform. and Comput. doi: 10.1016/0890-5401(92)90008-4 – volume: 165 start-page: 14 issue: 1 year: 2001 ident: 10.1016/j.tcs.2015.06.031_br0100 article-title: Linear concurrent constraint programming: operational and phase semantics publication-title: Inform. and Comput. doi: 10.1006/inco.2000.3002 – volume: 9 start-page: 145 issue: 1 year: 2002 ident: 10.1016/j.tcs.2015.06.031_br0190 article-title: Temporal concurrent constraint programming: denotation, logic and applications publication-title: Nordic J. Comput. – volume: 7 start-page: 563 issue: 3 year: 2006 ident: 10.1016/j.tcs.2015.06.031_br0110 article-title: Soft concurrent constraint programming publication-title: ACM Trans. Comput. Log. doi: 10.1145/1149114.1149118 – start-page: 145 year: 2008 ident: 10.1016/j.tcs.2015.06.031_br0300 article-title: Universal concurrent constraint programing: symbolic semantics and applications to security – volume: 305 start-page: 103 year: 2014 ident: 10.1016/j.tcs.2015.06.031_br0070 article-title: Dynamic spaces in concurrent constraint programming publication-title: Electron. Notes Theor. Comput. Sci. doi: 10.1016/j.entcs.2014.06.008 – volume: vol. 7454 start-page: 317 year: 2012 ident: 10.1016/j.tcs.2015.06.031_br0030 article-title: Spatial and epistemic modalities in constraint-based process calculi – year: 2008 ident: 10.1016/j.tcs.2015.06.031_br0380 – ident: 10.1016/j.tcs.2015.06.031_br0350 – volume: 12 start-page: 241 issue: 4–5 year: 2006 ident: 10.1016/j.tcs.2015.06.031_br0340 article-title: A logic of soft constraints based on partially ordered preferences publication-title: J. Heuristics doi: 10.1007/s10732-006-6347-5 – volume: vol. 4855 start-page: 544 year: 2007 ident: 10.1016/j.tcs.2015.06.031_br0290 article-title: Closures and modules within linear logic concurrent constraint programming – volume: 18 start-page: 535 issue: 4 year: 2013 ident: 10.1016/j.tcs.2015.06.031_br0170 article-title: Models and emerging trends of concurrent constraint programming publication-title: Constraints doi: 10.1007/s10601-013-9145-3 – start-page: 631 year: 1995 ident: 10.1016/j.tcs.2015.06.031_br0240 article-title: Valued constraint satisfaction problems: hard and easy problems – year: 1993 ident: 10.1016/j.tcs.2015.06.031_br0210 – volume: 11 start-page: 469 issue: 4–5 year: 2011 ident: 10.1016/j.tcs.2015.06.031_br0310 article-title: Observational equivalences for linear logic concurrent constraint languages publication-title: Theory Pract. Log. Program. doi: 10.1017/S1471068411000123 – volume: 23 start-page: 1 issue: 1 year: 2001 ident: 10.1016/j.tcs.2015.06.031_br0090 article-title: Semiring-based constraint logic programming: syntax and semantics publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/383721.383725 – volume: vol. 747 start-page: 97 year: 1993 ident: 10.1016/j.tcs.2015.06.031_br0260 article-title: Uncertainty in constraint satisfaction problems: a probabilistic approach – year: 2009 ident: 10.1016/j.tcs.2015.06.031_br0370 – start-page: 129 year: 2009 ident: 10.1016/j.tcs.2015.06.031_br0050 article-title: Algorithmic specifications in linear logic with subexponentials – year: 2014 ident: 10.1016/j.tcs.2015.06.031_br0280 article-title: Verification of spatial and temporal modalities in biochemical systems – volume: 14 start-page: 649 issue: 4–5 year: 2014 ident: 10.1016/j.tcs.2015.06.031_br0080 article-title: A proof theoretic study of soft concurrent constraint programming publication-title: Theory Pract. Log. Program. doi: 10.1017/S147106841400026X – volume: 22 start-page: 475 issue: 5/6 year: 1996 ident: 10.1016/j.tcs.2015.06.031_br0270 article-title: Timed default concurrent constraint programming publication-title: J. Symbolic Comput. doi: 10.1006/jsco.1996.0064 – volume: vol. 5649 start-page: 417 year: 2009 ident: 10.1016/j.tcs.2015.06.031_br0320 article-title: Types for secure pattern matching with local knowledge in universal concurrent constraint programming – volume: vol. 8052 start-page: 410 year: 2013 ident: 10.1016/j.tcs.2015.06.031_br0010 article-title: A general proof system for modalities in concurrent constraint programming – volume: 12 start-page: 247 issue: 2 year: 2004 ident: 10.1016/j.tcs.2015.06.031_br0330 article-title: Multiset rewriting and the complexity of bounded security protocols publication-title: J. Comput. Secur. doi: 10.3233/JCS-2004-12203 – volume: 4 start-page: 199 issue: 3 year: 1999 ident: 10.1016/j.tcs.2015.06.031_br0250 article-title: Semiring-based CSPs and valued CSPs: frameworks, properties, and comparison publication-title: Constraints doi: 10.1023/A:1026441215081 – volume: vol. 8410 start-page: 351 year: 2014 ident: 10.1016/j.tcs.2015.06.031_br0360 article-title: A core quantitative coeffect calculus – volume: 2 start-page: 297 issue: 3 year: 1992 ident: 10.1016/j.tcs.2015.06.031_br0120 article-title: Logic programming with focusing proofs in linear logic publication-title: J. Logic Comput. doi: 10.1093/logcom/2.3.297 – year: 2003 ident: 10.1016/j.tcs.2015.06.031_br0150 – year: 1992 ident: 10.1016/j.tcs.2015.06.031_br0390 article-title: Lectures on Linear Logic – volume: 269 start-page: 109 year: 2011 ident: 10.1016/j.tcs.2015.06.031_br0140 article-title: Specifying proof systems in linear logic with subexponentials publication-title: Electron. Notes Theor. Comput. Sci. doi: 10.1016/j.entcs.2011.03.009 – volume: vol. 2 year: 2006 ident: 10.1016/j.tcs.2015.06.031_br0220 – volume: vol. 4646 start-page: 405 year: 2007 ident: 10.1016/j.tcs.2015.06.031_br0160 article-title: From proofs to focused proofs: a modular proof of focalization in linear logic – volume: 44 start-page: 201 issue: 2 year: 1997 ident: 10.1016/j.tcs.2015.06.031_br0230 article-title: Semiring-based constraint satisfaction and optimization publication-title: J. ACM doi: 10.1145/256303.256306 – volume: 37 start-page: 139 issue: 1–3 year: 1998 ident: 10.1016/j.tcs.2015.06.031_br0200 article-title: Design, implementation, and evaluation of the constraint language cc(fd) publication-title: J. Log. Program. doi: 10.1016/S0743-1066(98)10006-7 – start-page: 333 year: 1991 ident: 10.1016/j.tcs.2015.06.031_br0020 article-title: Semantic foundations of concurrent constraint programming – volume: 45 start-page: 157 issue: 2 year: 2010 ident: 10.1016/j.tcs.2015.06.031_br0060 article-title: A framework for proof systems publication-title: J. Automat. Reason. doi: 10.1007/s10817-010-9182-1 – volume: vol. 713 start-page: 159 year: 1993 ident: 10.1016/j.tcs.2015.06.031_br0040 article-title: The structure of exponentials: uncovering the dynamics of linear logic proofs |
| SSID | ssj0000576 |
| Score | 2.257688 |
| Snippet | In previous works we have shown that linear logic with subexponentials (SELL), a refinement of linear logic, can be used to specify emergent features of... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 98 |
| SubjectTerms | Concurrent constraint programming Dynamical systems Dynamics Foundations Linear logic Logic Programming Proof systems Proving Specifications Temporal logic |
| Title | Subexponential concurrent constraint programming |
| URI | https://dx.doi.org/10.1016/j.tcs.2015.06.031 https://www.proquest.com/docview/1778026378 |
| Volume | 606 |
| WOSCitedRecordID | wos000366777000007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PT9swFLYmugM7sI0NDfZDQeLEFOT8sp1jNTFt01ZxqFBvVuzEqIWlFQ2ofz7vxXZSikDjsEtUpY3l-n1678X-3vsIORKG6ZyKIqwgtwhTxmgoFFXwqoJljlmidCvad_6bj0ZiMsnPnNrmspUT4HUtVqt88V9NDffA2Fg6-wxzd4PCDfgMRocrmB2u_2R4cAXVajGvkQbUNv-otevBpDEXREmIxtOy_vrANetA05U1aqf38NUFyX47FmmgjixyNe9y8rOp7e9pyWLF2nn9aHphYXcOrvVyfZ8hyrDgzpZB-voqPEPJrc6J952Mrns_qyft4mjUFrk9dNF2t2B20mjslh5lbftUFwnutcPeCFMdedDz0mYShpA4hERuHhbTD2Ke5eDbBsOfp5NffUTOuD2zdv_An263PL-NeTyWn2xE6jb9GL8hO-69IRhae78lL6p6l7z2mhyBc9G75NWfrg_v8h2h98EQ9GAIejAEa2B4T8bfT8fffoROIyPUCU-akJmI6jRWRZUXkHdURZFhE7zEoJB4mTJacCQGVZBXJyXLlIEvFDWK0dyUpUr2yFYNk_hAAsM1U7B-OklNKlQMqXeqMl7mOhalMGqfUL8wUrv-8TjNK_moQfbJcffIwjZPeerHqV9t6YBtszoJyHnqsUNvGQmeEY-7irqa3yxlxLmgMUu4OHjOPD6S7R7-n8hWc31TfSYv9W0zXV5_cdC6A5Bxh4w |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Subexponential+concurrent+constraint+programming&rft.jtitle=Theoretical+computer+science&rft.au=Olarte%2C+Carlos&rft.au=Pimentel%2C+Elaine&rft.au=Nigam%2C+Vivek&rft.date=2015-11-16&rft.issn=0304-3975&rft.volume=606&rft.spage=98&rft.epage=120&rft_id=info:doi/10.1016%2Fj.tcs.2015.06.031&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2015_06_031 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |