Efficient Abstraction and Refinement for Behavioral Description Based Web Service Composition

被引:0
作者
Kil, Hyunyoung [1 ]
Nam, Wonhong [1 ]
Lee, Dongwon [1 ]
机构
[1] Penn State Univ, University Pk, PA 16802 USA
来源
21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS | 2009年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The Web Service Composition (WSC) problem with respect to behavioral descriptions deals with the automatic synthesis of a coordinator web service, c, that controls a set of web services to reach a goal state. Despite its importance, however, solving the WSC problem for a general case (when c has only partial observations) remains to be doubly exponential in the number of variables in web service descriptions, rendering any attempts to compute an exact solution for modest size impractical. Toward this challenge, in this paper, we propose two novel (signature preserving and subsuming) approximation-based approaches using abstraction and refinement. We empirically validate that our proposals can solve realistic problems efficiently.
引用
收藏
页码:1740 / 1745
页数:6
相关论文
共 12 条
[1]  
[Anonymous], IJCAI
[2]  
ARMANO G, 2003, IJCAI 2003, P936
[3]  
Barbon F, 2006, ICWS 2006: IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS, P63
[4]   Strong planning under partial observability [J].
Bertoli, P ;
Cimatti, A ;
Roveri, M ;
Traverso, P .
ARTIFICIAL INTELLIGENCE, 2006, 170 (4-5) :337-384
[5]   MODEL CHECKING AND ABSTRACTION [J].
CLARKE, EM ;
GRUMBERG, O ;
LONG, DE .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1994, 16 (05) :1512-1542
[6]  
HUANG W, 2007, IJCAI, P1930
[7]   Computational Complexity of Web Service Composition Based on Behavioral Descriptions [J].
Kil, Hyunyoung ;
Nam, Wonhong ;
Lee, Dongwon .
20TH IEEE INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, VOL 1, PROCEEDINGS, 2008, :359-363
[8]  
Nam W, 2008, I W ADV ISS E COMMER, P331, DOI [10.1109/CEC/EEE.2008.29, 10.1109/CECandEEE.2008.108]
[9]  
Papadimitriou C.H., 1994, Computational complexity
[10]  
PISTORE M, 2005, ICAPS, P2