Concurrent constraint programming
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Non-monotonic concurrent constraint programming
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Default timed concurrent constraint programming
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
SLA management in federated environments
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on selected topics in network and systems management
Linear concurrent constraint programming: operational and phase semantics
Information and Computation
Handbook of Process Algebra
Belief Revision
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
The WSLA Framework: Specifying and Monitoring Service Level Agreements for Web Services
Journal of Network and Systems Management
Partial Order and SOS Semantics for Linear Constraint Programs
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Basic Concepts and Taxonomy of Dependable and Secure Computing
IEEE Transactions on Dependable and Secure Computing
A Framework for Failure Impact Analysis and Recovery with Respect to Service Level Agreements
SCC '05 Proceedings of the 2005 IEEE International Conference on Services Computing - Volume 02
Soft concurrent constraint programming
ACM Transactions on Computational Logic (TOCL)
A Nonmonotonic Soft Concurrent Constraint Language for SLA Negotiation
Electronic Notes in Theoretical Computer Science (ENTCS)
On Generalizing the AGM Postulates
Proceedings of the 2006 conference on STAIRS 2006: Proceedings of the Third Starting AI Researchers' Symposium
Enhancing constraints manipulation in semiring-based formalisms
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Negotiation as mutual belief revision
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
The complexity of soft constraint satisfaction
Artificial Intelligence
CC-Pi: a constraint-based language for specifying service level agreements
ESOP'07 Proceedings of the 16th European conference on Programming
Timed soft concurrent constraint programs
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
A process calculus for qos-aware applications
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
A secure coordination of agents with nonmonotonic soft Concurrent Constraint Programming
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Securely accessing shared resources with concurrent constraint programming
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
| Hi-index | 0.00 |
We present an extension of the Soft Concurrent Constraint language that allows the non-monotonic evolution of the constraint store. To accomplish this, we introduce some new operations: retract(c) reduces the current store by c, update X(c) transactionally relaxes all the constraints of the store that deal with the variables in the set X, and then adds a constraint c; nask(c) tests if c is not entailed by the store. The new retraction operators also permit to reason about Belief Revision, i.e. the process of changing beliefs to take into account a new piece of information. We present this framework as a possible solution to the negotiation of resources (e.g. web services and network resource allocation) that need a given Quality of Service (QoS). For this reason we also show the the new operators of the language satisfy the Belief Revision postulates [20], which can be used in the negotiation process. The QoS requirements (expressed as semiring levels) of all the parties should converge on a formal agreement through a negotiation process, which specifies the contract that must be enforced.