PUMA
Istituto di Informatica e Telematica     
Bistarelli S., Santini F. A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation. In: CILC08 - 23-esimo Convegno Italiano di Logica Computazionale (2008). Proceedings, pp. 147 - 162. Elsevier, 2008.
 
 
Abstract
(English)
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.
Subject Soft Constraint Logic Programming
Nonmonotonicity
Quality of Service
Service Level Agreement
D.4.6 Security and Protection


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional