2006
DOI: 10.1145/1124566.1124568
|View full text |Cite
|
Sign up to set email alerts
|

A comparative illustration of AI planning-based web services composition

Abstract: ________________________________________________________________________As the number of available web services proliferates, finding right web services to fulfill a given goal becomes an important task. In particular, a problem of combining multiple web services to satisfy a single task, known as web services composition problem, has received much attention recently, and various solutions have been proposed. Among many proposed solutions, however, it is not clear to use which one in what scenarios. In this pa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
44
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 76 publications
(44 citation statements)
references
References 10 publications
0
44
0
Order By: Relevance
“…Regarding representative AI planners capable of being used by WSC solvers, there are Graphplan [25], the SATPlan algorithm [32], and Blackbox. We conducted a further detailed survey on these algorithms and analyzed their distinct solving processes with respect to WSC context [33].…”
Section: Related Research Workmentioning
confidence: 99%
“…Regarding representative AI planners capable of being used by WSC solvers, there are Graphplan [25], the SATPlan algorithm [32], and Blackbox. We conducted a further detailed survey on these algorithms and analyzed their distinct solving processes with respect to WSC context [33].…”
Section: Related Research Workmentioning
confidence: 99%
“…In such techniques, both the initial state and the goal state are specified in the requirement by web service requester. AI planning composition techniques employ various methods including: Declarative composition, Situation calculus, Rule based composition, Theorem proving and Graph plan based composition [14,18,12]. The search based composition methods are categorized as: forward search based composition and backward search based composition.…”
Section: Related Work and Discussionmentioning
confidence: 99%
“…The search based composition methods are categorized as: forward search based composition and backward search based composition. In goal driven forward search based composition [12], the composition plan is generated in two phases. Firstly, selecting web services that match the requester's input values.…”
Section: Related Work and Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Researchers have developed diverse matching approaches [104]: (i ) exact syntactic equivalence in which a word comparison of names of services and attributes is performed, looking for an exact matching, (ii ) approximate match that offers functions to consider acceptable differences between words; and (iii ) semantic match that uses semantic distance, which is associated with the conceptual similarity using concepts networks named ontologies.…”
Section: Generation Phasementioning
confidence: 99%