Automatic Matchmaking of Web Services
Web services are meant for achieving automation in the interoperability across organizational boundaries. To achieve this goal, it is necessary that machines can reason over the meaning of the business processes and that of the data that is exchanged among the business processes. We propose a novel combination of pi-calculus and DLs for describing not only static semantic constraints but also the access control policies and behavior of a web service semantically. Further, we have developed a matchmaking algorithm that considers semantic, security and behavioral properties of web services. Our matchmaking algorithm not only returns match/no-match answers but in case of a match a set of conditions under which a web service offers the desired functionality.
Agarwal, S. and Ankolekar, A. 2006. Automatic matchmaking of web services. In Proceedings of the 15th International Conference on World Wide Web (Edinburgh, Scotland, May 23 - 26, 2006). WWW '06. ACM Press, New York, NY, 1057-1058.
Other items being presented by these speakers
Sponsor of The CIO Dinner