Many-Valued Institutions for Constraint Specification
We advance a general technique for enriching logical systems with soft constraints, making them suitable for specifying complex software systems where parts are put together not just based on how they meet certain functional requirements but also on how they optimise certain constraints. This added expressive power is required, for example, for capturing quality attributes that need to be optimised or, more generally, for formalising what are usually called service-level agreements. More specifically, we show how institutions endowed with a graded semantic consequence can accommodate soft-constraint satisfaction problems. We illustrate our approach by showing how, in the context of service discovery, one can quantify the compatibility of two specifications and thus formalise the selection of the most promising provider of a required resource.
KeywordsService Application Constraint Satisfaction Problem Service Discovery Residuated Lattice Soft Constraint
The authors would like to thank the anonymous referees for their very useful comments and suggestions. These have lead to an improved overall readability of the paper and to a more accurate presentation of the completeness requirement of the residuated lattices.
- 3.Bistarelli, S., Gadducci, F.: Enhancing constraints manipulation in semiring-based formalisms. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI, vol. 141, pp. 63–67. IOS Press (2006)Google Scholar
- 15.Fiadeiro, J.L., Orejas, F.: Abstract constraint data types. In: De Nicola, R., Hennicker, R. (eds.) Wirsing Festschrift. LNCS, vol. 8950, pp. 155–170. Springer, Heidelberg (2015)Google Scholar
- 18.Harman, M., Jia, Y., Krinke, J., Langdon, W.B., Petke, J., Zhang, Y.: Search based software engineering for software product lineengineering: a survey and directions for future work. In: Gnesi, S., Fantechi, A., Heymans, P., Rubin, J., Czarnecki, K., Dhungana, D. (eds.) Software Product Line, pp. 5–18. ACM (2014)Google Scholar
- 24.Schiex, T., Fargier, H., Verfaillie, G.: Valued constraint satisfaction problems: hard and easy problems. IJCAI 1(95), 631–639 (1995)Google Scholar
- 25.Ţuţu, I., Fiadeiro, J.L.: From conventional to institution-independent logic programming. J. Logic Comput. (2015). http://logcom.oxfordjournals.org/content/early/2015/06/04/logcom.exv021.abstract