An Initial Approach to Explaining SLA Inconsistencies
|Author||Müller Cejás, Carlos
Ruiz Cortés, Antonio
Resinas Arias de Reyna, Manuel
|Department||Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos|
|Published in||International Conference in Service Orientes Computing - ICSOC2008 (2008. Sydney, Australia)|
|Abstract||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 ...
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 WSAgreement 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.