Towards Scalable Web Service Composition with Partial Matches

We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowledge and we use the most general notion of matching, partial matches, where several web services can cooperate, each covering only a part of a requirement. Unsurprisingly, automatic composition in this setting is very hard. We identify a special case with simpler semantics, which covers many relevant scenarios. We develop a composition tool for this special case. Our goal is to achieve scalability: we overcome large search spaces by guiding the search using heuristic techniques. The computed solutions are optimal up to a constant factor. We test our approach on a simple, yet powerful real world use-case; the initial results attest the potential of the approach.

[1]  Tran Cao Son,et al.  Adapting Golog for Composition of Semantic Web Services , 2002, KR.

[2]  Boi Faltings,et al.  Large scale, type-compatible service composition , 2004 .

[3]  James A. Hendler,et al.  Information gathering during planning for Web Service composition , 2005, J. Web Semant..

[4]  Shankar Ponnekanti,et al.  SWORD: A Developer Toolkit for Web Service Composition , 2008 .

[5]  James A. Hendler,et al.  Template-based Composition of Semantic Web Services , 2005, AAAI Fall Symposium: Agents and the Semantic Web.

[6]  Dana S. Nau,et al.  The Incompleteness of Planning with Volatile External Information , 2006, ECAI.

[7]  Enrico Giunchiglia,et al.  Nonmonotonic causal theories , 2004, Artif. Intell..

[8]  Dana S. Nau,et al.  Web Service Composition with Volatile Information , 2005, SEMWEB.

[9]  Jianya Gong,et al.  Semantic markup for geospatial Web services , 2006, Geoinformatics.

[10]  Piergiorgio Bertoli,et al.  Web Service Composition as Planning, Revisited: In Between Background Theories and Initial State Uncertainty , 2007, AAAI.

[11]  Sheila A. McIlraith,et al.  Simulation, verification and automated composition of web services , 2002, WWW.

[12]  Ronen I. Brafman,et al.  Conformant planning via heuristic forward search: A new approach , 2004, Artif. Intell..

[13]  Marianne Winslett,et al.  Reasoning about Action Using a Possible Models Approach , 1988, AAAI.

[14]  Tanveer F. Syeda-Mahmood,et al.  SEMAPLAN: Combining Planning with Semantic Matching to Achieve Web Service Composition , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).

[15]  Tomasz Kaczmarek,et al.  Combining Scalability and Expressivity in the Automatic Composition of Semantic Web Services , 2008, 2008 Eighth International Conference on Web Engineering.

[16]  Wolfgang Faber,et al.  A logic programming approach to knowledge-state planning: Semantics and complexity , 2004, TOCL.

[17]  Jörg Hoffmann,et al.  Scalable Web Service Composition with Partial Matches , 2007, KWEPSY.

[18]  Jos de Bruijn,et al.  Enabling Semantic Web Services: The Web Service Modeling Ontology , 2006 .

[19]  Piergiorgio Bertoli,et al.  Automated composition of Web services via planning in asynchronous domains , 2005, Artif. Intell..

[20]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[21]  James A. Hendler,et al.  HTN planning for Web Service composition using SHOP2 , 2004, J. Web Semant..

[22]  Timothy W. Finin,et al.  A Planner for Composing Services Described in DAML-S , 2003 .

[23]  Annapaola Marconi,et al.  Automated Composition of Web Services by Planning at the Knowledge Level , 2005, IJCAI.

[24]  Jerry R. Hobbs,et al.  DAML-S: Semantic Markup for Web Services , 2001, SWWS.