ADL: exploring the middle ground between STRIPS and the situation calculus
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Fast planning through planning graph analysis
Artificial Intelligence
InfoSleuth: agent-based semantic integration of information in open and dynamic environments
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Spinning the Semantic Web: Bringing the World Wide Web to Its Full Potential
Spinning the Semantic Web: Bringing the World Wide Web to Its Full Potential
The Self-Serv Environment for Web Services Composition
IEEE Internet Computing
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
A software framework for matchmaking based on semantic web technology
WWW '03 Proceedings of the 12th international conference on World Wide Web
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Efficient Matchmaking and Directory Services
WI '03 Proceedings of the 2003 IEEE/WIC International Conference on Web Intelligence
Large Scale, Type-Compatible Service Composition
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Flexible and Efficient Matchmaking and Ranking in Service Directories
ICWS '05 Proceedings of the IEEE International Conference on Web Services
Forward-chaining planning in nondeterministic domains
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
STRIPS: a new approach to the application of theorem proving to problem solving
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Directory support for large-scale, automated service composition
SC'05 Proceedings of the 4th international conference on Software Composition
Automated Service Composition with Adaptive Planning
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Dynamically adaptive systems through automated model evolution using service compositions
SC'10 Proceedings of the 9th international conference on Software composition
Adaptive composition of conversational services through graph planning encoding
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
| Hi-index | 0.00 |
This paper presents planning-based service composition algorithms that dynamically interact with a potentially large-scale directory of service advertisements in order to retrieve matching service advertisements on demand. We start with a simple algorithm for untyped services, similar to a STRIPS planner. This algorithm is refined in two steps, first to exploit type information, and second to support partial type matches. An evaluation confirms that the algorithms scale well with increasing size of the directory and that the support for partial type matches is essential to achieve a low failure rate.