APPROACHES TO THE PROBLEM OF DETECTION EFFICIENCY SEMANTIC WEB SERVICES ON FUNCTIONAL LEVEL
Keywords:
Semantic Web, Web service, detection Web service, descriptive logic, best query coverageAbstract
Purpose of research is in analysis of possible approaches to automatic discovery Web-services satisfied to the query. In fact, query description is description of requested service. Our purpose is to build requested service with conjunction of existed services. It is unlikely to build service that is equivalent to query, so we need to create its best cover where “the best” means “the least”. Considered the best covering problem is one instance of the general framework for rewriting that use semantic distance between concepts, instead of subsumption or equivalence. Precisely, the problem reduces to reformulate a query Q into a description that contain as much as possible of common information with Q. Such reformulation is a cover of Q.References
Introduction to XML [Електронний ресурс]. – Режим доступу: http://www.w3schools.com/xml/xml_whatis.asp.
D. Fensel, C. Bussler, Y. Ding, and B. Omelayenko. The Web Service Modeling Framework WSMF. Electronic Commerce Research and Applications, 1(2), 2002.
D. Fensel, C. Bussler, and A. Maedche. Semantic Web Enabled Web Services. In International Semantic Web Conference, Sardinia, Italy, pages 1–2, Jun. 2002.
S. McIlraith, T.C. Son, and H. Zeng. Semantic Web Services. IEEE Intelligent Systems. Special Issue on the Semantic Web, 16(2):46–53, March/April 2001.
Srividya Kona, Ajay Bansal, Gopal Gupta Department of Computer Science The University of Texas at Dallas Richardson, TX 75083, Thomas D. Hite Metallect Corp. 2400 Dallas Parkway Plano, TX 75093Automatic Composition of Semantic Web Services.
F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and editors P. Patel- Schneider. The Description Logic Handbook. Theory, Implementation and Applications. Cambridge University Press, 2003.
F. Baader, R. Ku¨sters, and R. Molitor. Computing Least Common Subsumer in Description Logics with Existential Restrictions. In T. Dean, editor, Proc. of the 16th Int. Joint Conf. on AI, pages 96–101. M.K, 1999.
G. Teege. Making the difference: A subtraction operation for description log- ics. In J. Doyle, E. Sandewall, and P. Torasso, editors, KR’94, San Francisco, CA, 1994. Morgan Kaufmann.
Franz Baader, Ralf Ku¨sters, and Ralf Molitor. Rewriting Concepts Using Terminologies. In Proc. of the Int. Conf.KRColorado, USA, pages 297–308, Apr. 2000.
C. Beeri, A.Y. Levy, and M-C. Rousset. Rewriting Queries Using Views in Description Logics. In L. Yuan, editor, Proc. of the ACM PODS , New York, USA, pages 99–108, Apr. 1997.
F. Goasdou´e and M-C Rousset V. Latt`es. The Use of CARIN Language and Algorithms for Information Integration: The PICSEL System. IJICIS, 9(4):383–401, 2000.
Alon Y. Halevy. Answering queries using views: A survey. VLDB Journal, 10(4):270–294, 2001.
Franz Baader, Ralf Kiisters, and Ralf Molitor LuFg Theoretische Informatik, RWTH Aachen. Computing Least Common Subsumers in Description Logics with Existential Restriction, 1999.
Alon Y. Halevy. Answering queries using views: A survey. VLDB Journal, 10(4):270– 294, 2001.
B. Benatallah, M-S. Hacid, A. Leger, C. Rey, and F. Toumani. On automating Web services discovery. VLDB J., 14(1):84–96, 2005.
B. Benatallah, M-S. Hacid, H-Y. Paik, C. Rey, and F. Toumani. Towards semantic- driven, flexible and scalable framework for peering and querying e-catalog commu- nities. Information Systems, 31(4-5), 2006.
