Matching independent global constraints for composite web services
Proceedings of the 17th international conference on World Wide Web
E-Marketplace for Semantic Web Services
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Assembling Composite Web Services from Autonomous Components
Proceedings of the 2007 conference on Emerging Artificial Intelligence Applications in Computer Engineering: Real Word AI Systems with Applications in eHealth, HCI, Information Retrieval and Pervasive Technologies
Synthesis and Composition of Web Services
Formal Methods for Web Services
Graph Theoretic Topological Analysis of Web Service Networks
World Wide Web
Journal of Artificial Intelligence Research
Adaptive Hybrid Semantic Selection of SAWSDL Services with SAWSDL-MX2
International Journal on Semantic Web & Information Systems
Hi-index | 0.00 |
In this paper, we present a novel algorithm to compose Web services in the presence of semantic ambiguity by combining semantic matching and AI planning algorithms. Specifically, we use cues from domain-independent and domain-specific ontologies to compute an overall semantic similarity score between ambiguous terms. This semantic similarity score is used by AI planning algorithms to guide the searching process when composing services. Experimental results indicate that planning with semantic matching produces better results than planning or semantic matching alone. The solution is suitable for semi-automated composition tools or directory browsers.