AI Planning Search Time and Space Reduction Technique for the Problem of Web Service Composition

Hossein Rahmani

One of challenging problems in the domain of web services is the web service composition (i.e the task of composing web services to create new services, capable of fulfilling a need that no single service can satisfy). In real application, there will be a lot of relevant web services for a simple goal, so the search space for such a problem is huge. In this research statement, we show how by extracting some prior knowledge and using simple heuristics, search space and search time can be reduced significantly.

Subjects: 1.11 Planning; 15.7 Search

Submitted: May 2, 2008


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.