Semantic WS-agreement partner selection
Proceedings of the 15th international conference on World Wide Web
Improving Temporal-Awareness of WS-Agreement
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Explaining the Non-compliance between Templates and Agreement Offers in WS-Agreement
ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
Using automated analysis of temporal-aware SLAs in logistics
ICSOC/ServiceWave'09 Proceedings of the 2009 international conference on Service-oriented computing
WS-Governance: a policy language for SOA governance
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
A survey on service quality description
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
An SLA signed by all interested parties must be created carefully, avoiding contradictions between terms, because their terms could carry penalties in case of failure. However, this consistency checking may become a challenging task depending on the complexity of the agreement. As a consequence, an automated way of checking the consistency of an SLA document and returning the set of inconsistent terms of the agreement would be very appealing from a practical point of view. For instance, it enables the development of software tools that make the creation of correct SLAs and the consistency checking of imported SLAs easier for users. In this paper, we present the problem of explaining WS-Agreement inconsistencies as a constraint satisfaction problem (CSP), and then we use a CSP solver together with an explanation engine to check the consistency and return the inconsistent terms. Furthermore, a proof-of-concept using Choco solver in conjunction with the Palm explanation engine has been developed.