A Semantics-Based Web Service Matching Framework and Approach

Semantic Web Services promise seamless interoperability of data and applications on a semantic level, thus turning the Web from a world-wide information repository for human consumption only to a device of distributed computation. To this end, appropriate semantic descriptions of Web services and intelligent mechanisms working on this need a solid foundation in terms of the underlying semantically-enabled communication technologies. Recent advances in middleware technologies propose semantics-aware tuplespaces as an instrument for coping with the arising requirements of scalability, heterogeneity and dynamism. An additional argument is that Semantic Web Services have inherited the communication model of XML-based Web services, which is based on message exchange, thus being a priori incompatible with the REST architectural model of the Web. Analogously to the conventional Web, truly Web-compliant service communication should be based on persistent publication instead of message passing. In this chapter, we present “Triple Space computing”, a Triple Space-based coordination middleware for Semantic Web Services. We take a closer look at the respective data, infrastructure and coordination models that enable the management of formal knowledge and that support the interaction patterns characteristic for the Semantic Web and Semantic Web Services. Applying Triple Space computing to Semantic Execution Environments and Service-Oriented Infrastructures is the second main topic of this chapter.

Ontologies as a means for semantic description of web services have been discussed for many years. Various formal languages and correspoding tools using ontologies for describing web services have also been proposed (i.e. OWL-S). However, these existing approaches mainly are targeting domain experts creating ontologies. They are often too complex to be used by an average service provider offering web services online. But for offering and retrieving web services from future electronic marketplaces or service registries, a semantic service description is necessary. Therefore, in this paper an approach for an easy-to-use web-based editor for describing web services using ontologies based on the OWL-S language is proposed and evaluated. It not only supports a semantic, but also a commercial description of the web service offered, while remaining compatible with previous approaches addressing such holistic web service descriptions.

Service-oriented computing is gaining wider acceptance. For Web services to become practical, an infrastructure needs to be supported that allows users and applications to discover, deploy, compose and synthesize services automatically. For this automation to be effective, formal semantic descriptions of Web services should be available. In this paper we formally define the Web service discovery and composition problem and present an approach for automatic service discovery and composition based on semantic description of Web services. We also report on an implementation of a semantics-based automated service discovery and composition engine that we have developed. This engine employs a multi-step narrowing algorithm and is efficiently implemented using the constraint logic programming technology. The salient features of our engine are its scalability, i.e., its ability to handle very large service repositories, and its extremely efficient processing times for discovery and composition queries. We evaluate our engine for automated discovery and composition on repositories of different sizes and present the results.

Currently the semantic-based Web service matching has improved the precision ratio of service discovery. But it can't distinguish between different data on the different needs of the service, due to rarely considering the input data provenance of Web services. That is an important contribution of high precision ratio. Therefore, in this paper, for further improving the accuracy of Web service matching, the data provenance is considered as a constraint attribute of Web service matching. Firstly, an SP-tree-based Web service matching algorithm considering data provenance (SMDP) is proposed, consisting of three aspects: The general algorithm thoughts, the data How provenance matching calculation method, (which is mainly introduced for it is the hardest calculation part), and the experiments verifying precision ratio of SMDP is 10% higher than the traditional semantic-based matching. Secondly, a Web service matching model based on SMDP is designed and a prototype system for water resources application...

Semantic Web Service technology provides a strong support for automation software development based on Web service. By analyzing the existing description models and methods of semantic Web service, a Semantic Web Service Description Model (WSDM4S) and its formal description based on SHOIN+(D) are proposed, which attempt to offer an effective model for description, publication, discovery, composition, and execution of Web services based on semantic description. And a Semantic Web Service Description Language (WSDL4S) based on XML is designed to support the WSDM4S. Based on WSDL4S, Web Services could be packaged into basic semantic unit of semantic software development.

Service-orientation for the development of complex distributed systems with reusable components (services) has proved to be highly beneficial approach in software engineering. In order to realize its advantages automated techniques and tools for finding services, selecting the ones that match requestor needs, composing them for achieving enhanced functionality and resolving heterogeneity issues are required. Adding semantics to web services has become the key approach for the automation of service-orientation environments. Current paper proposes semantic approach for service selection and integration. It considers the semantic description of web services and involves reasoning on a knowledge base. The proposed approach for web service discovery and integration is based on designing logic based techniques for matching goal description with the semantic annotation of web services. It provides for the automation of web service search which facilitates the design of practical applications in service-oriented environment.

This article tackles the problem of supplying the low level commanders with information from information sources located on higher command levels, distributed using web services, the most commonly used technology in modern command and control systems. There has been proposed the Adaptation Framework For Web Services Provision (AFRO) that defines a mechanism for effective web services invocation in tactical networks, which are considered disadvantaged in terms of available throughput, delay and error rate. Its implementation, in the form of AFRO Proxy performs so called adaptation actions, which are modifications of the SOAP XML messages by changing their encoding to more efficient or dropping information that are accepted to be removed by the service requester. The proposed adaptation mechanism gives promising effects for low level commanders located at the battlefield. They can be supplied with information generally available on high command levels, which, up to now, were very rarely distributed to tactical networks.

Web services have emerged as a major technology for deploying automated interactions between distributed and heterogeneous applications. The main advantage of Web services composition is the possibility of creating value-added services by combining existing ones to achieve customized tasks. How to combine these services efficiently into an arrangement that is both functionally sound and architecturally realizable is a very challenging topic that has founded a significant research area within computer science. A great deal of recent Web-related research has concentrated on dynamic Web service composition. Most of proposed models for dynamic composition use semantic descriptions of Web services through the construction of domain ontology. In this paper, we present our approach to dynamically produce composite services. It is based on the use of two Artificial Intelligence (AI) techniques: Case-Based Reasoning (CBR) and AI planning. Our motivating scenario concerns a national system for the monitoring of childhood immunization.

Semantic Web service matchmaking is the process of searching the space of possible matches between demands and supplies, and finds the best available ones. To achieve this, the semantic Web service matchmaking framework is one of the absolutely necessary components of service oriented architecture. This paper proposes a matchmaking framework based on Description Logic for semantic Web service described by RDF4S model, a novel semantic Web service description which consists of three layers: service oriented knowledge base, semantic description model and semantic description language. We describe the service description and service query conditions by using the ontologies that are included in service oriented knowledge base. The service resource specification is described according to Description Logics syntax and a Description Logic reasoner is used to compare service descriptions. By representing the semantics of service descriptions, the matchmaker enables the behavior of an intelligent agent to approach more closely that of a human user trying to locate suitable Web service resources.

A difficulty of sharing messages transferred among Web services is absence of common vocabulary, and the semantic organization and description of Web services is an important requirement for enabling the automatic discovery, selection, composition, execution and monitoring of Web services. This paper proposes a model for semantic-based interaction between Web services. The method defined some ontology-based vocabularies to describe different Web services and some mapping rules among those vocabularies. Compared with existing methods, the method considers the Web services together with the semantic interpretation, satisfiability and reasoning of distributed ontologies. So the method can ensure the share and reusage of term be used for describing parameters of Web services.

The Web Services technology failed to meet its promises of fully automating the communication between applications. It necessitated human intervention in the selection and invocation of the most appropriate web service. The Web Service Modeling Ontology (WSMO) and the Web Service Modeling eXecution environment (WSMX) are two initiatives claiming to be supporting the Semantic Web Services technology, which promises the automation of the whole communication process including these two steps. The paper tested validity of the initiatives' claim by using them to develop a Semantic Web Service (SWS) for accessing the publications of the German University in Cairo (GUC). The results showed that the initiatives were able to meet the Semantic Web Services' promises and automate the selection and the invocation of the most matching Web Service.

This paper presents a new approach for automatic Web service composition based on the formalism of Fluent Calculus using semantic Web service descriptions. In our approach, the Web service composition process is viewed as an AI planning problem in the Fluent Calculus formalism. To semantically describe Web services, we have used a Web service domain ontology which is then translated into a Fluent Calculus knowledge base, necessary for the composition planning phase. For verifying the composed services, the Label Transition System Analyzer (LTSA) formalism is used. The paper also presents an experimental prototype for the Fluent Calculus based Web service composition and demonstrates its effectiveness with the help of an application scenario from the social event planning domain.

This paper presents PORSCE II, an integrated system that performs automatic Semantic Web service composition exploiting artificial intelligence (AI) techniques, specifically planning. Essential steps in achieving Web service composition include the translation of the Web service composition problem into a solver-ready planning domain and problem, followed by the acquisition of solutions, and the translation of the solutions back to Web service terms. The solutions to the problem, that is, the descriptions of the desired composite service, are obtained by means of external domain-independent planning systems, they are visualized and finally evaluated. Throughout the entire process, the system exploits semantic information extracted from the semantic descriptions of the available Web services and the corresponding ontologies, in order to perform composition under semantic awareness and relaxation.

Semantic Web Services are a search effort to automate the usage of Web services, a necessary component for the Semantic Web. Traditionally, Web service discovery depends on detail formal semantic descriptions of available services. Since a complete detailed service is not always feasible, the client software cannot select the best service offer for a given user goal only by using the static service descriptions. Dynamic discovery based on semantic description of services is an essential aspect of the Semantic Web Service integration process Some data needs to be obtained during run0time because not all data required for service discovery can always be included in service descriptions. This paper shows when and why complete semantic description is unfeasible and it defines the role and position of offer discovery. We propose an approach for offer discovery of semantic web services using OWL-S IDE during discovery process. We also present the algorithm, the implementation and some preliminary results.

We apply our work on Web service discovery with initially incomplete information to the problem of service composition. Rich semantic descriptions of Goals and Web services allow the unambiguous specification of constraints on what services are required and offered respectively. However, the data provided in service descriptions may be incomplete. We describe how missing instance data may be fetched dynamically and used for richer service discovery. We show how the resultant knowledge base can be used for simple compositions of services having mutual constraints.