Semantic Matching of Web Service Policies

In this work, we present a novel approach for matching the nonfunctional properties of Web Services represented using WS-policy. To date, most policy matching has been done using syntactic approaches, where pairs of policies are compared for structural and syntactic similarity to determine compatibility. In our approach, we enhance the policies of a Web Service with semantics by creating the policy assertions based on terms from ontologies. The use of semantic terms enables richer representations of the intent of a policy and allows matching of policies with compatible intent, but dissimilar syntax. Also, in cases where policies are defined at multiple levels/domains (such as security, privacy, trust, transactional etc.), we handle inter-domain policy interactions by processing the rules represented in the semantic domain models. This helps identify any inconsistencies in policies during specification as well matching. This approach of using semantic concepts and rules during policy matching leads to better Web Service matches that may not have been possible with syntax based matchers, or prior semantic based methods.

By: Kunal Verma; Rama K. Akkiraju; Richard T. Goodwin

Published in: RC23809 in 2005


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .