On Complexity of The Tightening Problem for Web Service Discovery

A goal of the service oriented paradigm/SOA is to facilitate automated service composition. Motivated by scenarios in e-business and e-science, the automated composition problem starts with a specification of a "goal" service and a set of searchable existing services. The composition problem relies on discovering relevant services at the semantic level, mainly, through entry/exit conditions, and assembling them into a "realization" of the goal service. Based on this framework, we study in this paper a tightening problem which strengthens service discovery queries formulated from conditions in the goal service. A tighter condition can find more relevant services while a looser one may exclude the possibility of assembling a goal realization. The tightening problem is studied for conditions in different logic languages, mainly, conditions with order constraints and linear arithmetic. The complexity of the tightening problem is given for both integers and real numbers.

[1]  Amit P. Sheth,et al.  Meteor-s web service annotation framework , 2004, WWW '04.

[2]  Martin Fürer,et al.  The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth , 1982, Theor. Comput. Sci..

[3]  W.M.P. van der Aalst,et al.  On the automatic generation of workflow processes based on product structures , 1999 .

[4]  Volker Weispfenning.  The Complexity of Almost Linear Diophantine Problems , 1990, J. Symb. Comput..

[5]  Volker Weispfenning,et al.  The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.

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

[7]  Jianwen Su,et al.  Web service discovery based on behavior signatures , 2005, 2005 IEEE International Conference on Services Computing (SCC'05) Vol-1.

[8]  Wei Sun,et al.  Solving satisfiability and implication problems in database systems , 1996, TODS.

[9]  Diego Calvanese,et al.  Automatic Composition of Transition-based Semantic Web Services with Messaging , 2005, VLDB.

[10]  Jianwen Su,et al.  On Completeness of Web Service Compositions , 2007, IEEE International Conference on Web Services (ICWS 2007).

[11]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[12]  Mark Klein,et al.  Discovering Services: Towards High-Precision Service Retrieval , 2002, WES.

[13]  Amit P. Sheth,et al.  Semantic E-Workflow Composition , 2003, Journal of Intelligent Information Systems.

[14]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[15]  Sheila A. McIlraith,et al.  Analysis and simulation of Web services , 2003, Comput. Networks.

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

[17]  Michael Winikoff,et al.  Exact functional context matching for web services , 2004, ICSOC '04.

[18]  Katia Sycara,et al.  Adding OWL-S to UDDI, implementation and throughput , 2004 .

[19]  Shiyong Lu,et al.  Semantic correctness of transactions and workflows , 2002 .

[20]  Thomas Heinis,et al.  Developing scientific workflows from heterogeneous services , 2006, SGMD.

[21]  Jianwen Su,et al.  E-services: a look behind the curtain , 2003, PODS.

[22]  Myong H. Kang,et al.  Adding OWL-S Support to the Existing UDDI Infrastructure , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).

[23]  Anne H. H. Ngu,et al.  QoS-aware middleware for Web services composition , 2004, IEEE Transactions on Software Engineering.

[24]  Diego Calvanese,et al.  Automatic Composition of E-services That Export Their Behavior , 2003, ICSOC.

[25]  Oscar H. Ibarra,et al.  Automated composition of e-services: lookaheads , 2004, ICSOC '04.

[26]  Jos de Bruijn,et al.  Web Service Modeling Ontology , 2005, Appl. Ontology.

[27]  Xiaomeng Su,et al.  A Survey of Automated Web Service Composition Methods , 2004, SWSWPC.

[28]  Jianwen Su,et al.  Tools for composite web services: a short overview , 2005, SGMD.

[29]  Matthias Klusch,et al.  Automated semantic web service discovery with OWLS-MX , 2006, AAMAS '06.

[30]  Xiang Fu,et al.  Realizability of conversation protocols with message contents , 2004, Proceedings. IEEE International Conference on Web Services, 2004..

[31]  Xiang Fu,et al.  Conversation protocols: a formalism for specification and verification of reactive electronic services , 2003, Theor. Comput. Sci..

[32]  Anne H. H. Ngu,et al.  Declarative composition and peer-to-peer provisioning of dynamic Web services , 2002, Proceedings 18th International Conference on Data Engineering.

[33]  Volker Weispfenning,et al.  Complexity and uniformity of elimination in Presburger arithmetic , 1997, ISSAC.

[34]  Edward A. Lee,et al.  Scientific workflow management and the Kepler system , 2006, Concurr. Comput. Pract. Exp..