Semantic API matching for automatic service composition

Proceedings of the 13th International World Wide Web Conference on Alternate Track, Papers and Posters, WWW Alt. 2004

Volumn , Issue , 2004, Pages 436-437

  Caragea, Doina ^a   Syeda Mahmood, Tanveer ^b  

^a Iowa State University   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUALITY OF SERVICE; WORLD WIDE WEB;

AUTOMATIC SERVICE COMPOSITION; MAXIMUM MATCHINGS; OPTIMAL MATCH; PARTITE GRAPHS; SEMANTIC SCHEMATA;

SEMANTICS;

EID: 54749143231     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1013367.1013513     Document Type: Conference Paper

References (8)

1. T. Berners-Lee et al. The semantic web. Scientific American, 2001.
2. A. Goldberg and Kennedy. An efficient cost-scaling algorithm for the assignment problem. SIAM Journal on Discrete Mathematics, 6(3):443-459, 1993.
3. J. Blythe et al. The role of planning in grid computing. In Proc. ICAPS, 2003.
4. J. Madhavan, P. A. Bernstein, and E. Rahm. Generic schema matching with cupid. In The VLDB Journal, pages 49-58, 2001.
5. D. McDermott. Estimated regression planning for interactions with web services. In Proc. AIPS, 2002.
6. S. Melnik et al. Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In Proc. ICDE, 2002.
7. G.A. Miller. Wordnet: A lexical database for English. Communications of the ACM, 38(11):39-41, 1995.
8. Evren Sirin, James Hendler, and Bijan Parsia. Semi automatic composition of web services using semantic descriptions.