A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation
We present an extension of the Soft Concurrent Constraint language that allows the nonmonotonic evolution of the constraint store. To accomplish this, we introduce some new operations: the retract(c) reduces the current store by c, the updateX(c) transactionally relaxes all the constraints of the st...
Uloženo v:
| Vydáno v: | Electronic notes in theoretical computer science Ročník 236; s. 147 - 162 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
02.04.2009
|
| Témata: | |
| ISSN: | 1571-0661, 1571-0661 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We present an extension of the Soft Concurrent Constraint language that allows the nonmonotonic evolution of the constraint store. To accomplish this, we introduce some new operations: the retract(c) reduces the current store by c, the updateX(c) transactionally relaxes all the constraints of the store that deal with the variables in the set X, and then adds a constraint c; the nask(c) tests if c is not entailed by the store. We present this framework as a possible solution to the management of resources (e.g. web services and network resource allocation) that need a given Quality of Service (QoS). The QoS requirements of all the parties should converge, through a negotiation process, on a formal agreement defined as the Service Level Agreement, which specifies the contract that must be enforced. c-semirings are the algebraic structures that we use to model QoS metrics. |
|---|---|
| AbstractList | We present an extension of the Soft Concurrent Constraint language that allows the nonmonotonic evolution of the constraint store. To accomplish this, we introduce some new operations: the retract(c) reduces the current store by c, the updateX(c) transactionally relaxes all the constraints of the store that deal with the variables in the set X, and then adds a constraint c; the nask(c) tests if c is not entailed by the store. We present this framework as a possible solution to the management of resources (e.g. web services and network resource allocation) that need a given Quality of Service (QoS). The QoS requirements of all the parties should converge, through a negotiation process, on a formal agreement defined as the Service Level Agreement, which specifies the contract that must be enforced. c-semirings are the algebraic structures that we use to model QoS metrics. |
| Author | Bistarelli, Stefano Santini, Francesco |
| Author_xml | – sequence: 1 givenname: Stefano surname: Bistarelli fullname: Bistarelli, Stefano email: bista@sci.unich.it, stefano.bistarelli@iit.cnr.it organization: Dipartimento di Scienze, Università “G. d'Annunzio” di Chieti-Pescara, Pescara, Italy – sequence: 2 givenname: Francesco surname: Santini fullname: Santini, Francesco email: f.santini@imtlucca.it, francesco.santini@iit.cnr.it organization: IMT Lucca - School for Advanced Studies, Lucca, Italy |
| BookMark | eNqFkLFOwzAURS1UJNrCF7DkBxKe49ROBoaqohQpgqEwW67zXLlqbWS7SPw9ScuAGGB6dzlX950JGTnvkJBbCgUFyu92BbqkY1ECNAWwAkq4IGM6EzQHzunoR74ikxh3AKymgo_Jcp49e3fwzifvrM7W3qRs4Z0-htB3DjGmoGwfW-W2R7XFzPiQrdsexK1PViXr3TW5NGof8eb7Tsnb8uF1scrbl8enxbzNNavqlFdNDRR4JThuOMVSM6606prGCFM3ZWk6oUD0lyFXnalLgbipZkyVWteC12xKmnOvDj7GgEZqm04LhpF7SUEOQuROnoTIQYgEJnshPct-se_BHlT4_Ie6P1PYv_VhMcioLTqNnQ2ok-y8_ZP_Ak08fdU |
| CitedBy_id | crossref_primary_10_4018_jwsr_2010040102 crossref_primary_10_4018_irmj_2015010103 crossref_primary_10_1007_s10703_013_0191_7 crossref_primary_10_1007_s10270_012_0236_1 crossref_primary_10_1016_j_cosrev_2008_10_001 crossref_primary_10_1016_j_jlap_2010_04_001 crossref_primary_10_1016_j_artint_2011_03_004 |
| Cites_doi | 10.7551/mitpress/2086.001.0001 10.1023/A:1008746126376 10.1023/A:1022445108617 10.1016/j.artint.2006.04.002 10.1109/69.729707 10.1145/1149114.1149118 10.1016/S1389-1286(00)00149-3 10.7551/mitpress/4298.003.0045 10.1145/256303.256306 10.1006/inco.2000.3002 |
| ContentType | Journal Article |
| Copyright | 2009 Elsevier B.V. |
| Copyright_xml | – notice: 2009 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.entcs.2009.03.020 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1571-0661 |
| EndPage | 162 |
| ExternalDocumentID | 10_1016_j_entcs_2009_03_020 S1571066109000991 |
| GroupedDBID | --K --M 0R~ 0SF 1B1 1~5 4.4 457 4G. 5GY 5VS 6I. 7-5 71M AABNK AACTN AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAQFI AAXUO ABMAC ACDAQ ACGFO ACGFS ACNNM ACRLP ACXMD ADBBV ADEZE ADMUD AEKER AEXQZ AFTJW AGHFR AIEXJ AIKHN AITUG ALMA_UNASSIGNED_HOLDINGS AMRAJ AXJTR CS3 DU5 EBS EJD EO8 EO9 EP2 EP3 FDB FEDTE FNPLU G-Q HVGLF HZ~ IHE IXB J1W KOM KQ8 M41 M~E N9A NCXOZ O-L O9- OK1 OZT P2P RIG ROL RPZ SDF SDG SES SPC SSV SSW SSZ 29G 9DU AAQXK AAYWO AAYXX ABFNM ABWVN ACLOT ACRPL ACVFH ADCNI ADFGL ADNMO ADVLN AEIPS AEUPX AFPUW AGQPQ AIGII AJMQA AKBMS AKRWK AKYEP ANKPU AOUOD ASPBG AVWKF AZFZN CITATION FGOYB GBLVA R2- SEW ~HD |
| ID | FETCH-LOGICAL-c348t-4980106476eb61e2c36acad99f7f8922fd7a0722f3e6adf827eeb453a2cc87683 |
| ISICitedReferencesCount | 18 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000216907200011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1571-0661 |
| IngestDate | Sat Nov 29 02:22:08 EST 2025 Tue Nov 18 22:29:00 EST 2025 Fri Feb 23 02:31:17 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | quality of service nonmonotonicity soft constraint logic programming service level agreement |
| Language | English |
| License | http://creativecommons.org/licenses/by-nc-nd/3.0 https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c348t-4980106476eb61e2c36acad99f7f8922fd7a0722f3e6adf827eeb453a2cc87683 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.entcs.2009.03.020 |
| PageCount | 16 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_entcs_2009_03_020 crossref_primary_10_1016_j_entcs_2009_03_020 elsevier_sciencedirect_doi_10_1016_j_entcs_2009_03_020 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-04-02 |
| PublicationDateYYYYMMDD | 2009-04-02 |
| PublicationDate_xml | – month: 04 year: 2009 text: 2009-04-02 day: 02 |
| PublicationDecade | 2000 |
| PublicationTitle | Electronic notes in theoretical computer science |
| PublicationYear | 2009 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Bistarelli, S. and F. Gadducci Jennings, Faratin, Lomuscio, Parsons, Sierra, Wooldridge (bib014) 2001; 10 Saraswat, V., R. Jagadeesan and V. Gupta Best, de Boer, Palamidessi (bib001) 1997; 1282 (1995), pp. 272–285 Bistarelli, Montanari, Rossi (bib007) 2006; 7 Bistarelli, Montanari, Rossi (bib006) 1997; 44 1993, pp. 315–334 Saraswat, V. and P. Lincoln Bistarelli, Gabbrielli, Meo, Santini (bib004) 2008; 5052 1995, pp. 417–431 Codognet, P. and F. Rossi Bistarelli (bib003) 2004; 2962 Cohen, Cooper, Jeavons, Krokhin (bib010) 2006; 170 in Technical report, Xerox Parc (1992) Yokoo, Durfee, Ishida, Kuwabara (bib021) 1998; 10 Saraswat, V.A., M. Rinard and P. Panangaden Fages, Ruet, Soliman (bib013) 2001; 165 Keller, Ludwig (bib015) 2003; 11 (1991), pp. 333–352 De Nicola, Ferrari, Montanari, Pugliese, Tuosto (bib012) 2005; 3454 Saraswat, V. and M. Rinard de Boer, F.S., J.N. Kok, C. Palamidessi and J.J.M.M. Rutten Bhoj, Singhal, Chutani (bib002) 2001; 35 (1990), pp. 232–245 Buscemi, Montanari (bib008) 2007; 4421 Saraswat, V.A., R. Jagadeesan and V. Gupta (2006), pp. 63–67 10.1016/j.entcs.2009.03.020_bib011 Bhoj (10.1016/j.entcs.2009.03.020_bib002) 2001; 35 Buscemi (10.1016/j.entcs.2009.03.020_bib008) 2007; 4421 Bistarelli (10.1016/j.entcs.2009.03.020_bib006) 1997; 44 10.1016/j.entcs.2009.03.020_bib020 Best (10.1016/j.entcs.2009.03.020_bib001) 1997; 1282 Fages (10.1016/j.entcs.2009.03.020_bib013) 2001; 165 Jennings (10.1016/j.entcs.2009.03.020_bib014) 2001; 10 Keller (10.1016/j.entcs.2009.03.020_bib015) 2003; 11 Yokoo (10.1016/j.entcs.2009.03.020_bib021) 1998; 10 Bistarelli (10.1016/j.entcs.2009.03.020_bib004) 2008; 5052 Cohen (10.1016/j.entcs.2009.03.020_bib010) 2006; 170 10.1016/j.entcs.2009.03.020_bib018 De Nicola (10.1016/j.entcs.2009.03.020_bib012) 2005; 3454 10.1016/j.entcs.2009.03.020_bib019 10.1016/j.entcs.2009.03.020_bib009 Bistarelli (10.1016/j.entcs.2009.03.020_bib003) 2004; 2962 10.1016/j.entcs.2009.03.020_bib005 10.1016/j.entcs.2009.03.020_bib016 Bistarelli (10.1016/j.entcs.2009.03.020_bib007) 2006; 7 10.1016/j.entcs.2009.03.020_bib017 |
| References_xml | – reference: Saraswat, V. and P. Lincoln, – volume: 10 start-page: 199 year: 2001 end-page: 215 ident: bib014 article-title: Automated negotiation: prospects, methods and challenges publication-title: Int. Journal of Group Decision and Negotiation – reference: (1995), pp. 272–285 – reference: , 1993, pp. 315–334 – reference: , in: – volume: 3454 start-page: 33 year: 2005 end-page: 48 ident: bib012 article-title: A process calculus for QoS-aware applications publication-title: COORDINATION'95 – volume: 5052 start-page: 50 year: 2008 end-page: 66 ident: bib004 article-title: Timed Soft Concurrent Constraint Programs publication-title: COORDINATION'08 – reference: Saraswat, V., R. Jagadeesan and V. Gupta, – reference: Saraswat, V.A., R. Jagadeesan and V. Gupta, – volume: 4421 start-page: 18 year: 2007 end-page: 32 ident: bib008 article-title: CC-Pi: A constraint-based language for specifying service level agreements publication-title: ESOP'07 – reference: Saraswat, V.A., M. Rinard and P. Panangaden, – reference: Codognet, P. and F. Rossi, – reference: de Boer, F.S., J.N. Kok, C. Palamidessi and J.J.M.M. Rutten, – volume: 1282 start-page: 256 year: 1997 end-page: 273 ident: bib001 article-title: Partial Order and SOS Semantics for Linear Constraint Programs publication-title: COORDINATION'97 – volume: 170 start-page: 983 year: 2006 end-page: 1016 ident: bib010 article-title: The complexity of soft constraint satisfaction publication-title: Artif. Intell. – reference: Saraswat, V. and M. Rinard, – volume: 10 start-page: 673 year: 1998 end-page: 685 ident: bib021 article-title: The distributed constraint satisfaction problem: Formalization and algorithms publication-title: IEEE Transactions on Knowledge and Data Engineering – volume: 165 start-page: 14 year: 2001 end-page: 41 ident: bib013 article-title: Linear concurrent constraint programming: operational and phase semantics publication-title: Inf. Comput. – volume: 44 start-page: 201 year: 1997 end-page: 236 ident: bib006 article-title: Semiring-based constraint satisfaction and optimization publication-title: J. ACM – volume: 35 start-page: 5 year: 2001 end-page: 24 ident: bib002 article-title: SLA management in federated environments publication-title: Comput. Networks – volume: 2962 year: 2004 ident: bib003 article-title: Semirings for Soft Constraint Solving and Programming publication-title: LNCS – reference: (2006), pp. 63–67 – reference: , 1995, pp. 417–431 – reference: Bistarelli, S. and F. Gadducci, – volume: 11 start-page: 57 year: 2003 end-page: 81 ident: bib015 article-title: The WSLA framework: Specifying and monitoring service level agreements for web services publication-title: J. Netw. Syst. Manage. – reference: , Technical report, Xerox Parc (1992) – volume: 7 start-page: 563 year: 2006 end-page: 589 ident: bib007 article-title: Soft concurrent constraint programming publication-title: ACM Trans. Comput. Logic – reference: (1990), pp. 232–245 – reference: (1991), pp. 333–352 – ident: 10.1016/j.entcs.2009.03.020_bib005 – ident: 10.1016/j.entcs.2009.03.020_bib017 doi: 10.7551/mitpress/2086.001.0001 – volume: 10 start-page: 199 year: 2001 ident: 10.1016/j.entcs.2009.03.020_bib014 article-title: Automated negotiation: prospects, methods and challenges publication-title: Int. Journal of Group Decision and Negotiation doi: 10.1023/A:1008746126376 – ident: 10.1016/j.entcs.2009.03.020_bib011 – volume: 5052 start-page: 50 year: 2008 ident: 10.1016/j.entcs.2009.03.020_bib004 article-title: Timed Soft Concurrent Constraint Programs – volume: 11 start-page: 57 year: 2003 ident: 10.1016/j.entcs.2009.03.020_bib015 article-title: The WSLA framework: Specifying and monitoring service level agreements for web services publication-title: J. Netw. Syst. Manage. doi: 10.1023/A:1022445108617 – volume: 2962 year: 2004 ident: 10.1016/j.entcs.2009.03.020_bib003 article-title: Semirings for Soft Constraint Solving and Programming – volume: 170 start-page: 983 year: 2006 ident: 10.1016/j.entcs.2009.03.020_bib010 article-title: The complexity of soft constraint satisfaction publication-title: Artif. Intell. doi: 10.1016/j.artint.2006.04.002 – volume: 10 start-page: 673 year: 1998 ident: 10.1016/j.entcs.2009.03.020_bib021 article-title: The distributed constraint satisfaction problem: Formalization and algorithms publication-title: IEEE Transactions on Knowledge and Data Engineering doi: 10.1109/69.729707 – ident: 10.1016/j.entcs.2009.03.020_bib016 – volume: 1282 start-page: 256 year: 1997 ident: 10.1016/j.entcs.2009.03.020_bib001 article-title: Partial Order and SOS Semantics for Linear Constraint Programs – ident: 10.1016/j.entcs.2009.03.020_bib018 – ident: 10.1016/j.entcs.2009.03.020_bib019 – volume: 7 start-page: 563 year: 2006 ident: 10.1016/j.entcs.2009.03.020_bib007 article-title: Soft concurrent constraint programming publication-title: ACM Trans. Comput. Logic doi: 10.1145/1149114.1149118 – volume: 35 start-page: 5 year: 2001 ident: 10.1016/j.entcs.2009.03.020_bib002 article-title: SLA management in federated environments publication-title: Comput. Networks doi: 10.1016/S1389-1286(00)00149-3 – ident: 10.1016/j.entcs.2009.03.020_bib020 – ident: 10.1016/j.entcs.2009.03.020_bib009 doi: 10.7551/mitpress/4298.003.0045 – volume: 4421 start-page: 18 year: 2007 ident: 10.1016/j.entcs.2009.03.020_bib008 article-title: CC-Pi: A constraint-based language for specifying service level agreements – volume: 44 start-page: 201 year: 1997 ident: 10.1016/j.entcs.2009.03.020_bib006 article-title: Semiring-based constraint satisfaction and optimization publication-title: J. ACM doi: 10.1145/256303.256306 – volume: 165 start-page: 14 year: 2001 ident: 10.1016/j.entcs.2009.03.020_bib013 article-title: Linear concurrent constraint programming: operational and phase semantics publication-title: Inf. Comput. doi: 10.1006/inco.2000.3002 – volume: 3454 start-page: 33 year: 2005 ident: 10.1016/j.entcs.2009.03.020_bib012 article-title: A process calculus for QoS-aware applications |
| SSID | ssj0038176 |
| Score | 1.5586506 |
| Snippet | We present an extension of the Soft Concurrent Constraint language that allows the nonmonotonic evolution of the constraint store. To accomplish this, we... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 147 |
| SubjectTerms | nonmonotonicity quality of service service level agreement soft constraint logic programming |
| Title | A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation |
| URI | https://dx.doi.org/10.1016/j.entcs.2009.03.020 |
| Volume | 236 |
| WOSCitedRecordID | wos000216907200011&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: 1571-0661 dateEnd: 20201231 omitProxy: false ssIdentifier: ssj0038176 issn: 1571-0661 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1571-0661 dateEnd: 20201231 omitProxy: false ssIdentifier: ssj0038176 issn: 1571-0661 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwELa2wKGXtpRWhT7kA7dtVsHOxvZxVYE40FUlQOIWTRy7AqEELSnaU387Y8fehIdW5dBLdmWtncTz7cxkMjMfIfulQbttM56UaC6TDFAW0uJTioCqNIpByoz1ZBNiPpcXF-rXaLSMtTB316Ku5XKpbv6rqHEMhe1KZ18g7tWiOIDfUeh4RLHj8Z8EPxvPmxrP1rSe3OYU9ayr69OhEZNj6PS8EO34JMQqfarh6QlONL-bdiCrGLHvqXJwVZ_B9aAAUgdmiHEwp33gHV3Phev4GfLJLNTNKqQDjqPiMjrPqK508yAE4d-mpGyoNYVLn-q6qk_MM2NB1TI-VJYHXa_NYHcPOq38RKV30YWrCW6Rvg0NRvkkZWlvweJb-0eGbZVuGDPZrgq_iKPeVEXKC1zkFdlkYqqcPvz59zDacNe20NelxZuI_ap8ZuCTK3nepxn4KWfvyJvwgEFnHTC2ycjU78nbSN5Bgy7fIUczOsQJdTihPU5ojxMacUIRJxRxQgc4-UDOjw7PfhwngVQj0TyTbZIp6cIAmcgN_j0N0zwHDZVSVlipGLOVgFTgJzc5VFYyYUyZTTkwrdFySv6RbNRNbT4RCoyB4srIDCCDUgODKZSmEkrnaLzsLmFxWwodOs67C78u1ghkl3xfTbrpGq6s_3ke97sIIO98wQLxs27i3svO85m87pH_hWy0iz_mK9nSd-3l7eKbB889NJWQbg |
| linkProvider | ISSN International Centre |
| 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=A+Nonmonotonic+Soft+Concurrent+Constraint+Language+for+SLA+Negotiation&rft.jtitle=Electronic+notes+in+theoretical+computer+science&rft.au=Bistarelli%2C+Stefano&rft.au=Santini%2C+Francesco&rft.date=2009-04-02&rft.issn=1571-0661&rft.eissn=1571-0661&rft.volume=236&rft.spage=147&rft.epage=162&rft_id=info:doi/10.1016%2Fj.entcs.2009.03.020&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_entcs_2009_03_020 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1571-0661&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1571-0661&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1571-0661&client=summon |