Abstract

A semantic web service modeling, matching and composition methods based on description logic (DL) rule and process algebra is introduced in this paper. It introduces process algebra constructor into DL to figure out OWL-S static and dynamic functional semantic characters, and expands the concept of service semantic matching to support the composability judgments between atomic service and composition process, even between different composition processes. Moreover, composition inference rules based on semantic matching for more general composition structures such as Sequence, Choice, Split, Join and Split+Join etc are also discussed. Therefore, both sequence and parallel web composition can be resolved into reasoning based on semantic matching and composition inference rules mentioned above in DL framework.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.