Constraint satisfaction in dynamic web service composition

被引：17

作者：

Channa, N ^{[1
]}

Li, SP ^{[1
]}

Shaikh, AW ^{[1
]}

Fu, XJ ^{[1
]}

机构：

[1] Zhejiang Univ, Coll Comp Sci, Hangzhou 310027, Peoples R China

来源：

Sixteenth International Workshop on Database and Expert Systems Applications, Proceedings | 2005年

关键词：

D O I：

10.1109/DEXA.2005.68

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Web services composition is a crucial aspect of web services technology, which gives us the opportunity for selecting new services and best suits our needs at the moment. Doing this automatically would require us to compute our criteria for composing candidate services. Our research represent all criteria guiding the selection of the services as constraints then choose an optimal set of services to satisfy the customers requirements. This approach reduces the dynamic composition of web services to a constraint satisfaction problem. This work will support in future to semantic web process.

引用

页码：658 / 664

页数：7

共 12 条

[1]

ARKIN A, BUSINESS PROCESS MOD

[2] The Self-Serv environment for Web services composition [J].

Benatallah, B ;

Sheng, QZ ;

Dumas, M .

IEEE INTERNET COMPUTING, 2003, 7 (01) :40-48

[3]

BENATALLAH B, 2002, PATTERNS SKELETONS P

[4]

BUSSLER C, 2001, CONCEPTUAL ARCHITECT

[5]

CURBERA F, 2001, WEB SERVICES WORKSH

[6]

FENSEL D, 2002, P INT SEM WEB C, V2342

[7]

FIKES R, J WEB SEMANTICS

[8]

KUMAR V, 1992, J AI MAGAZINE, P32

[9]

MCILLRAITH S, 2002, P 8 INT C KNOWL REPR

[10]

OWL S, SEMANTIC MARKUP WEB

← 1 2 →