Advertisement

Preference and Similarity-Based Behavioral Discovery of Services

  • Farhad Arbab
  • Francesco Santini
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7843)

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.

Keywords

Soft Constraint Service Operation Weighted Constraint Service Behavior Fuzzy Ontology 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Belhajjame, K., Brambilla, M.: Ontological description and similarity-based discovery of business process models. IJISMD 2(2), 47–66 (2011)Google Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    Bistarelli, S.: Semirings for Soft Constraint Solving and Programming. Springer (2004), http://dl.acm.org/citation.cfm?id=993462
  6. 6.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. J. ACM 44(2), 201–236 (1997)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Bistarelli, S., Santini, F.: A nonmonotonic soft concurrent constraint language to model the negotiation process. Fundam. Inform. 111(3), 257–279 (2011)MathSciNetzbMATHGoogle Scholar
  8. 8.
    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
  9. 9.
    Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer Publishing Company, Incorporated (2009)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Hau, J., Lee, W., Darlington, J.: A semantic similarity measure for semantic web services. In: Web Service Semantics Workshop at WWW (2005)Google Scholar
  12. 12.
    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 Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    OWL-S: Semantic Markup for Web Services (2004), http://www.w3.org/Submission/OWL-S/
  16. 16.
    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 Google Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    Toch, E., Gal, A., Reinhartz-Berger, I., Dori, D.: A semantic approach to approximate service retrieval. ACM Trans. Internet Technol. 8(1) (November 2007)Google Scholar
  19. 19.
    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)CrossRefGoogle Scholar
  20. 20.
    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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Farhad Arbab
    • 1
  • Francesco Santini
    • 1
    • 2
  1. 1.Centrum Wiskunde & InformaticaAmsterdamNetherlands
  2. 2.Dipartimento di Matematica e InformaticaUniversità di PerugiaItaly

Personalised recommendations