Handbook of theoretical computer science (vol. B)
Simulation, verification and automated composition of web services
Proceedings of the 11th international conference on World Wide Web
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Formal Verification of e-Services and Workflows
CAiSE '02/ WES '02 Revised Papers from the International Workshop on Web Services, E-Business, and the Semantic Web
A software framework for matchmaking based on semantic web technology
WWW '03 Proceedings of the 12th international conference on World Wide Web
Distributed enactment of multiagent workflows: temporal logic for web service composition
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Toward High-Precision Service Retrieval
IEEE Internet Computing
Automated semantic web service discovery with OWLS-MX
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Similarity search for web services
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Using information content to evaluate semantic similarity in a taxonomy
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.01 |
Service matchmaking is the process of finding suitable services given by the providers for the service requests of consumers. Previous approaches to service matchmaking is mostly based on matching the input-output parameters of service requests and service provisions. However, such approaches do not capture the semantics of the services and hence cannot match requests to services effectively. This paper proposes an agent-based approach for matchmaking that is based on capturing the semantics of services and requests formally through temporal logic. Requests are represented as a set of properties and compared to the service representations using model checking, yielding results on whether a service can satisfy a request or not. By help of domain ontologies, our approach also supports flexible matching, where partially matching services are identified. We provide a general framework, where our approach can work with other existing matchmaking approaches and is integrated with current efforts such as OWL-S and SWRL.