메뉴 건너뛰기




Volumn , Issue , 2009, Pages 165-172

Efficient discovery of collision-free service combinations

Author keywords

[No Author keywords available]

Indexed keywords

INDIVIDUAL SERVICE; MATCHMAKING ALGORITHMS; SERVICE DISCOVERY; SIDE EFFECT;

EID: 70449509575     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICWS.2009.105     Document Type: Conference Paper
Times cited : (3)

References (13)
  • 1
    • 35448953781 scopus 로고    scopus 로고
    • Classification of the state-of-the-art dynamic web services composition techniques
    • A. Atif, E. Mohamed, and S. A. El. Classification of the state-of-the-art dynamic web services composition techniques. International Journal of Web and Grid Services, 2:148-166, 2006.
    • (2006) International Journal of Web and Grid Services , vol.2 , pp. 148-166
    • Atif, A.1    Mohamed, E.2    El, S.A.3
  • 3
    • 46849106299 scopus 로고    scopus 로고
    • Improved matchmaking algorithm for semantic web services based on bipartite graph matching
    • IEEE Computer Society
    • U. Bellur and R. Kulkarni. Improved matchmaking algorithm for semantic web services based on bipartite graph matching. In IEEE International Conference on Web Services, pages 86-93. IEEE Computer Society, 2007.
    • (2007) IEEE International Conference on Web Services , pp. 86-93
    • Bellur, U.1    Kulkarni, R.2
  • 4
    • 0242339632 scopus 로고    scopus 로고
    • Request rewriting-based web service discovery
    • Lecture Notes in Computer Science, Springer
    • B. Benatallah, M.-S. Hacid, C. Rey, and F. Toumani. Request rewriting-based web service discovery. In International Semantic Web Conference, volume 2870 of Lecture Notes in Computer Science, pages 242-257. Springer, 2003.
    • (2003) International Semantic Web Conference , vol.2870 , pp. 242-257
    • Benatallah, B.1    Hacid, M.-S.2    Rey, C.3    Toumani, F.4
  • 5
    • 34047209211 scopus 로고    scopus 로고
    • A flexible directory query language for the efficient processing of service composition queries
    • W. Binder, I. Constantinescu, and B. Faltings. A flexible directory query language for the efficient processing of service composition queries. Int. J. Web Service Res, 4(1):59-79, 2007.
    • (2007) Int. J. Web Service Res , vol.4 , Issue.1 , pp. 59-79
    • Binder, W.1    Constantinescu, I.2    Faltings, B.3
  • 6
    • 35048896448 scopus 로고    scopus 로고
    • Coupled signature and specification matching for automatic service binding
    • L.-J. Zhang, editor, Lecture Notes in Computer Science, Springer
    • M. Klein and B. König-Ries. Coupled signature and specification matching for automatic service binding. In L.-J. Zhang, editor, 2004 European Conference on Web Services, volume 3250 of Lecture Notes in Computer Science, pages 183-197. Springer, 2004.
    • (2004) 2004 European Conference on Web Services , vol.3250 , pp. 183-197
    • Klein, M.1    König-Ries, B.2
  • 7
    • 33751049760 scopus 로고    scopus 로고
    • What is needed for semantic service descriptions? A proposal for suitable language constructs
    • M. Klein, B. König-Ries, and M. Mussig. What is needed for semantic service descriptions? A proposal for suitable language constructs. International Journal of Web and Grid Services, 1(3/4):328-364, 2005.
    • (2005) International Journal of Web and Grid Services , vol.1 , Issue.3-4 , pp. 328-364
    • Klein, M.1    König-Ries, B.2    Mussig, M.3
  • 10
    • 0011491265 scopus 로고    scopus 로고
    • Adapting golog for composition of semantic web services
    • Morgan Kaufmann, San Francisco, California
    • S. McIlraith and T. C. San. Adapting Golog for composition of semantic web services. In KR2002: Principles of Knowledge Representation and Reasoning, pages 482-493. Morgan Kaufmann, San Francisco, California, 2002.
    • (2002) KR2002: Principles of Knowledge Representation and Reasoning , pp. 482-493
    • McIlraith, S.1    San, T.C.2
  • 11
    • 84864486684 scopus 로고    scopus 로고
    • Semantic matching of web services capabilities
    • Lecture Notes in Computer Science, Springer
    • M. Paolucci, T. Kawamura, T. R. Payne, and K. P. Sycara. Semantic matching of web services capabilities. In International Semantic Web Conference, volume 2342 of Lecture Notes in Computer Science, pages 333-347. Springer, 2002.
    • (2002) International Semantic Web Conference , vol.2342 , pp. 333-347
    • Paolucci, M.1    Kawamura, T.2    Payne, T.R.3    Sycara, K.P.4
  • 12
    • 0018053728 scopus 로고
    • The complexity of satisfiability problems
    • New York, May, ACM Press
    • T. J. Schaefer. The complexity of satisfiability problems. In ACM Symposium on Theory of Computing (STOC '78), pages 216-226, New York, May 1978. ACM Press.
    • (1978) ACM Symposium on Theory of Computing (STOC '78) , pp. 216-226
    • Schaefer, T.J.1
  • 13
    • 35048860338 scopus 로고    scopus 로고
    • Automated composition of semantic web services into executable processes
    • Lecture Notes in Computer Science, Springer
    • P. Traverso and M. Pistore. Automated composition of semantic web services into executable processes. In International Semantic Web Conference, volume 3298 of Lecture Notes in Computer Science, pages 380-394. Springer, 2004.
    • (2004) International Semantic Web Conference , vol.3298 , pp. 380-394
    • Traverso, P.1    Pistore, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.