Type based service composition
Ion Constantinescu,Boi Faltings,Walter Binder +2 more
- 19 May 2004
- pp 268-269
TL;DR: This work reports experiments on randomly generated composition problems that show that using partial matches can decrease the failure rate of the integration algorithm using only complete matches by up to 7 times with no increase in the number of directory accesses required.
read more
Abstract: Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches of input/output types. However, this does not work when the available services only cover a part of the range of the input type. We present an algorithm that also allows partial matches and composes them using switches that decide on the required service at runtime based on the actual data type. We report experiments on randomly generated composition problems that show that using partial matches can decrease the failure rate of the integration algorithm using only complete matches by up to 7 times with no increase in the number of directory accesses required. This shows that composition with partial matches is an essential and useful element of web service composition.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A formal model for semantic web service composition
Freddy Lecue,Alain Léger +1 more
- 05 Nov 2006
TL;DR: In this article, an innovative and formal model for an AI planning-oriented web service composition is presented, which supports a semantic context in order to find a correct, complete, consistent and optimal plan as a solution.
•Proceedings Article
Formal Model for Semantic Web Service Composition
Freddy Lecue
- 01 Jul 2005
TL;DR: An innovative and formal model for an AI planning-oriented composition of Web service composition is presented and supports a semantic context in order to find a correct, complete, consistent and optimal plan as a solution.
113
Process-Level composition of executable web services: ”on-the-fly” versus ”once-for-all” composition
Marco Pistore,Pierluigi Roberti,Paolo Traverso +2 more
- 29 May 2005
TL;DR: This paper proposes a solution to two kinds of process-level composition problems: on-the-fly compositions that satisfy one-shot user requests specified as composition goals, and a more general form, called once-for-all compositions, whose goal is to build a general composed web service that is able to interact directly with the users, receive requests from them, and propose suitable answers.
Message-based web service composition, integrity constraints, and planning under uncertainty: a new connection
TL;DR: The computational properties of the forward effects case are clarified, and a strong relation to standard notions of planning under uncertainty is pointed out, suggesting that effective tools for the latter can be successfully adapted to address the former.
A minimalist approach to semantic annotations for web processes compositions
Marco Pistore,Luca Spalazzi,Paolo Traverso +2 more
- 11 Jun 2006
TL;DR: In this paper, the authors propose a new approach to the automated composition of distributed processes described as semantic web services by keeping separate the procedural and the ontological descriptions, and linking them through semantic annotations.
References
•Proceedings Article
Adapting Golog for Composition of Semantic Web Services
Sheila A. McIlraith,Tran Cao Son +1 more
- 01 Jan 2002
TL;DR: It is argued that an augmented version of the logic programming language Golog provides a natural formalism for automatically composing services on the Semantic Web and logical criteria for these generic procedures that define when they are knowledge self-sufficient and physically selfsufficient are proposed.
•Proceedings Article
Mobilizing the semantic web with DAML-enabled web services
Sheila Mcllraith,Tran Cao Son,Honglei Zeng +2 more
- 01 May 2001
TL;DR: This paper proposes markup of Web services in the DAML family of semantic Web markup languages, and presents one logic-based agent technology for service composition, predicated on the use of reusable, task-specific, high-level generic procedures and user-specific customizing constraints.
Efficient matchmaking and directory services
Ion Constantinescu,Boi Faltings +1 more
- 13 Oct 2003
TL;DR: This work shows how matchmaking with DAML-S specifications can be integrated with efficient methods for searching and maintaining balanced directory trees and reports on experimental results using an implementation based on generalised search trees.
85
Interleaving Discovery and Composition for Simple Workflows
Ora Lassila,Sapna Dixit +1 more
- 01 Jan 2004
TL;DR: A simple approach for service discovery and composition, where services are described using a subset of the DAML-S ontology, and the central idea is to base composition on the mismatch between service discovery queries and their results, and iteratively letting this guide subsequent queries.
Semantic Matching of Web Services Capabilities
Massimo Paolucci,Takahiro Kawamura,Terry R. Payne,Katia Sycara +3 more
- 09 Jun 2002
TL;DR: In this article, the authors propose a solution based on DAML-S, a DAMLbased language for service description, and show how service capabilities are presented in the Profile section of a DAMl-S description and how a semantic match between advertisements and requests is performed.
Related Papers (5)
Mithun Sheshagiri,Marie desJardins,Tim Finin +2 more
- 30 Jun 2003
Biplav Srivastava,Jana Koehler +1 more
- 01 Jan 2003
Freddy Lecue,Alain Léger +1 more
- 05 Nov 2006