Automatic composition of information-providing web services based on query rewriting
ABSTRACT Compared with normal web services, information-providing services have unique features that have seldom been considered in
existing research on the automatic composition of web services. In this paper, we present a simple, yet well-formed, semantic-based
capability model for information-providing web services, which can express such features as not modifying the world state
and not requiring all input/output parameters to be supplemented with class information as semantics. We then present a corresponding
automatic composition method derived from a query rewriting algorithm, MiniCon, used in the data integration field. This method
adequately utilizes previous features, enables primitive semantic reasoning, and can generate executable BPEL scripts automatically.
Performance of the method is complementary to traditional search-based ones. Experiments on a typical type of problem show
that the method is usable in practice.
Keywordsweb services–automatic composition–query rewriting–data integration–ontology–semantic web
- SourceAvailable from: Yijun Yu
Conference Paper: A Lightweight Approach to Semantic Web Service Synthesis[Show abstract] [Hide abstract]
ABSTRACT: Web service technologies are becoming a new paradigm for distributed computing. With increasing number of web services available on the internet, there is an urgent need for information brokers that can autonomously integrate web services on behalf of a user. To this end, we propose web service specification, which defines what the service is but not how the service is implemented, and service synthesizer, which can dynamically synthesize the implementation of the specification from existing web services over the web.Web Information Retrieval and Integration, 2005. WIRI '05. Proceedings. International Workshop on Challenges in; 05/2005
- [Show abstract] [Hide abstract]
ABSTRACT: Generating query-answering plans for information gathering agents requires to translate a user query, formulated in terms of a set of virtual relations, to a query that uses relations that are actually stored in information sources. Previous solutions to the translation problem produced sets of conjunctive plans, and were therefore limited in their ability to handle information sources with binding-pattern limitations, and to exploit functional dependencies in the domain model. As a result, these plans were incomplete w.r.t. sources encountered in practice (i.e., produced only a subset of the possible answers). We describe the novel class of recursive information gathering plans, which enables us to settle two open problems. First, we describe an algorithm for finding a query plan that produces the maximal set of answers from the sources in the presence of functional dependencies. Second, we describe an analogous algorithm in the presence of binding-pattern restric...03/2000;
- [Show abstract] [Hide abstract]
ABSTRACT: We present an OWL-S service composition planner, called OWLS-Xplan, that allows for fast and flexible composition of OWL-S services in the semantic Web. OWLS-Xplan con-verts OWL-S 1.1 services to equivalent problem and domain descriptions that are specified in the planning domain descrip-tion language PDDL 2.1, and invokes an efficient AI plan-ner Xplan to generate a service composition plan sequence that satisfies a given goal. Xplan extends an action based FastForward-planner with a HTN planning and re-planning component.