AND/OR Graph and Search Algorithm for Discovering Composite Web Services
This paper presents a formalization of the Web Service composition problem as a search problem in an AND/OR graph, and a search algorithm for searching the graph to identify composite service(s) that satisfies a Web Service request. Given a service request that can only be satisfied by a composition...
Saved in:
Main Authors: | LIANG, Qianhui (Althea), SU, Stanley Y. W. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2005
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/217 https://ink.library.smu.edu.sg/context/sis_research/article/1216/viewcontent/ANDOR_Graph_Search_2005.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
INTERACTIVE GRAPH SEARCH: ALGORITHMS AND ANALYSES
by: CONG QIANHAO
Published: (2023) -
FORMAL ANALYSIS OF WEB SERVICE COMPOSITION
by: CHEN MANMAN
Published: (2015) -
Clustering Web Services for Automatic Categorization
by: LIANG, Qianhui (Althea), et al.
Published: (2009) -
Verification and Analysis of Web Service Composition
by: TAN TIAN HUAT
Published: (2013) -
Ontology-Based Compatibility Checking for Web Service Configuration Management
by: LIANG, Qianhui (Althea), et al.
Published: (2008)