A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Larks: Dynamic Matchmaking Among Heterogeneous Software Agents in Cyberspace
Autonomous Agents and Multi-Agent Systems
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
Exact functional context matching for web services
Proceedings of the 2nd international conference on Service oriented computing
A Multilevel Composability Model for Semantic Web Services
IEEE Transactions on Knowledge and Data Engineering
SEMAPLAN: Combining Planning with Semantic Matching to Achieve Web Service Composition
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Verification of web service descriptions using graph-based traversal algorithms
Proceedings of the 2007 ACM symposium on Applied computing
Matching Strictly Dependent Global Constraints for Composite Web Services
ECOWS '07 Proceedings of the Fifth European Conference on Web Services
Approximate Structure-Preserving Semantic Matching
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
VGC: Generating Valid Global Communication Models of Composite Services Using Temporal Reasoning
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Independent global constraints for web service composition based on GA and APN
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
An Efficient Approach to Web Service Selection
WISM '09 Proceedings of the International Conference on Web Information Systems and Mining
Constraint Web Service Composition Based on Discrete Particle Swarm Optimization
WISM '09 Proceedings of the International Conference on Web Information Systems and Mining
Web services composition handling user constraints: towards a semantic approach
Proceedings of the 12th International Conference on Information Integration and Web-based Applications & Services
Towards proactive web service adaptation
CAiSE'12 Proceedings of the 24th international conference on Advanced Information Systems Engineering
Algorithms for Web service selection with static and dynamic requirements
Service Oriented Computing and Applications
Hi-index | 0.00 |
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall than syntactic-based ones (as they employ ontological reasoning mechanisms to match syntactically heterogeneous descriptions). However, semantic-based approaches still have problems (e.g. lack of scalability as an exhaustive search is often performed to located services conforming to constraints). This paper proposes two approaches that deal with the problem of scalability/performance for composite service location. First, services are indexed based on the values they assign to their restricted attributes (the attributes restricted by a given constraint). Then, services that assign "conforming values" to those attributes are combined to form composite services. The first proposed approach extends a local optimisation technique to perform the latter, since identifying such values is NP-hard. However, this approach returns false negatives since the local optimisation technique does not consider all the values. Hence, a second approach that derives conforming values using domain rules is defined. The used rules are returned with each composite service so that a user can understand the context in which it is retrieved. Results obtained from the experiments that varied the number of available services demonstrate that the performance of the local optimisation-based approach is 76% better than existing semantic-based approaches and recall is 98% higher than syntactic-based approaches.