论文信息 - Web service composition as planning

Web service composition as planning

We show how the service composition problem can be viewed as a planning problem in which state descriptions are ambiguous and operator definitions are incomplete. We then discuss the problem of interpreting documents (which describe the world state), and introduce a semantic type matching algorithm. The matching algorithm together with an interleaved search and execution algorithm allow for basic automated ser-

[1] Marco Pistore,et al. A Request Language for Web-Services Based on Planning and Constraint Satisfaction , 2002, TES.

[2] Luciano Serafini,et al. Planning for web services the hard way , 2003, 2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings..

[3] Craig A. Knoblock,et al. Dynamically Composing Web Services from On-line Sources , 2002 .

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

[5] Graeme Hirst,et al. Semantic distance in WordNet: An experimental, application-oriented evaluation of five measures , 2004 .

[6] Drew McDermott,et al. Estimated-Regression Planning for Interactions with Web Services , 2002, AIPS.

[7] Christiane Fellbaum,et al. Book Reviews: WordNet: An Electronic Lexical Database , 1999, CL.

[8] Erhard Rahm,et al. A survey of approaches to automatic schema matching , 2001, The VLDB Journal.