Abstract
We extend Constraint Automata by replacing boolean constraints with semiring-based soft constraints. The obtained general formal tool can be used to represent preference-based and similarity-based queries, which allow a user more freedom in choosing the behavior of the service to finally use, among all possible choices. A user states his preferences through a “soft” query, and obtains results that satisfy this query with different levels of preference. The soft requirements may involve a parameter data of the service operations, or the (names of the) operations themselves. Moreover, we introduce a first implementation of the search procedure by using declarative (soft) Constraint Programming.
This work was carried out during the tenure of the ERCIM “Alain Bensoussan” Fellowship Programme. This Programme is supported by the Marie Curie Co-funding of Regional, National and International Programmes (COFUND) of the European Commission.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arbab, F., Rutten, J.J.M.M.: A coinductive calculus of component connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2003. LNCS, vol. 2755, pp. 34–55. Springer, Heidelberg (2003)
Baier, C., Sirjani, M., Arbab, F., Rutten, J.J.M.M.: Modeling component connectors in Reo by constraint automata. Sci. Comput. Program. 61(2), 75–113 (2006)
Belhajjame, K., Brambilla, M.: Ontological description and similarity-based discovery of business process models. IJISMD 2(2), 47–66 (2011)
Benbernou, S., Canaud, E., Pimont, S.: Semantic web services discovery regarded as a constraint satisfaction problem. In: Christiansen, H., Hacid, M.-S., Andreasen, T., Larsen, H.L. (eds.) FQAS 2004. LNCS (LNAI), vol. 3055, pp. 282–294. Springer, Heidelberg (2004)
Bistarelli, S.: Semirings for Soft Constraint Solving and Programming. Springer (2004), http://dl.acm.org/citation.cfm?id=993462
Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. J. ACM 44(2), 201–236 (1997)
Bistarelli, S., Santini, F.: A nonmonotonic soft concurrent constraint language to model the negotiation process. Fundam. Inform. 111(3), 257–279 (2011)
Dong, X., Halevy, A., Madhavan, J., Nemes, E., Zhang, J.: Similarity search for web services. In: A Comparative Study of Very large data bases, vol. 30, pp. 372–383. VLDB Endowment (2004), http://dl.acm.org/citation.cfm?id=1316689.1316723
Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer Publishing Company, Incorporated (2009)
Grigori, D., Corrales, J.C., Bouzeghoub, M.: Behavioral matchmaking for service retrieval. In: IEEE International Conference on Web Services, ICWS, pp. 145–152. IEEE Computer Society (2006)
Hau, J., Lee, W., Darlington, J.: A semantic similarity measure for semantic web services. In: Web Service Semantics Workshop at WWW (2005)
Klusch, M., Fries, B., Sycara, K.: Automated semantic web service discovery with OWLS-MX. In: Proceedings of Autonomous Agents and Multiagent Systems, AAMAS 2006, pp. 915–922. ACM, New York (2006), http://doi.acm.org/10.1145/1160633.1160796
Laburthe, F.: CHOCO: implementing a CP kernel. In: Proceedings of TRICS: Techniques for Implementing Constraint Programming Systems, a Post-Conference Workshop of CP, pp. 71–85 (2000)
Meng, S., Arbab, F.: Web services choreography and orchestration in Reo and constraint automata. In: Proceedings of the 2007 ACM Symposium on Applied Computing, SAC, pp. 346–353. ACM (2007)
OWL-S: Semantic Markup for Web Services (2004), http://www.w3.org/Submission/OWL-S/
Pan, J.Z., Stamou, G., Stoilos, G., Taylor, S., Thomas, E.: Scalable querying services over fuzzy ontologies. In: Proceedings of World Wide Web, WWW 2008, pp. 575–584. ACM, New York (2008), http://doi.acm.org/10.1145/1367497.1367575
Shen, Z., Su, J.: Web service discovery based on behavior signatures. In: Proceedings of the 2005 IEEE International Conference on Services Computing, SCC 2005, vol. 01, pp. 279–286. IEEE Computer Society, Washington, DC (2005)
Toch, E., Gal, A., Reinhartz-Berger, I., Dori, D.: A semantic approach to approximate service retrieval. ACM Trans. Internet Technol. 8(1) (November 2007)
Wang, Y., Stroulia, E.: Semantic structure matching for assessing web-service similarity. In: Orlowska, M.E., Weerawarana, S., Papazoglou, M.P., Yang, J. (eds.) ICSOC 2003. LNCS, vol. 2910, pp. 194–207. Springer, Heidelberg (2003)
Zemni, M.A., Benbernou, S., Carro, M.: A soft constraint-based approach to QoS-aware service selection. In: Maglio, P.P., Weske, M., Yang, J., Fantinato, M. (eds.) ICSOC 2010. LNCS, vol. 6470, pp. 596–602. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arbab, F., Santini, F. (2013). Preference and Similarity-Based Behavioral Discovery of Services. In: ter Beek, M.H., Lohmann, N. (eds) Web Services and Formal Methods. WS-FM 2012. Lecture Notes in Computer Science, vol 7843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38230-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-38230-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38229-1
Online ISBN: 978-3-642-38230-7
eBook Packages: Computer ScienceComputer Science (R0)