Matchmaking for semantic web services with constraints on process models

  • Authors:
  • Natenapa Sriharee;Twittie Senivongse

  • Affiliations:
  • Department of Computer Engineering, Chulalongkorn University, Pathumwan, Bangkok, Thailand;Department of Computer Engineering, Chulalongkorn University, Pathumwan, Bangkok, Thailand

  • Venue:
  • AIKED'06 Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Service discovery is part of the service-oriented architectural model and supported by any of the realising technologies including Web Services. This paper presents an agent-based system for discovering semantic Web Services whose behaviour is described by OWL-S process model. Rules can be set to constrain service processes, and criteria for considering matching between a service process and the expected capability in a consumer's query are proposed. The matching algorithm follows the flexible match approach which involves ontological matching and evaluation of process constraints. Relevant services can be retrieved and ranked by consumer's preference criteria.