Workflow compositions in the context of Web services represent an important application of semantic matchmaking. Existing matchmaking frameworks utilizing a strict capability-based matchmaking prove to be inadequate for this application. To address these limitations, we present a parameterized semantic matchmaking framework that exhibits a customizable matchmaking behavior. Using an example scenario, we argue that such customization is essential for application in workflows, and demonstrate the wider applicability of our matchmaking algorithm. Additionally, we outline an industrial application of our technique.
By: Prashant Doshi, Richard T. Goodwin, Rama Akkiraju, Sascha Roeder
Published in: RC23133 in 2004
LIMITED DISTRIBUTION NOTICE:
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 reports@us.ibm.com .