|
Web Services Challenge 2007 Tokyo, Japan 23-26 July 2007 |
|
Semantic Composition Description NOTE: For information regarding changes since the 2006 competition, please read the "What's New" section below.
Semantic Representation In the syntactic competition matching of services is based on the string equivalence of partnames of the input and output messages of a service. In the semantic competition we adopt the idea of so called Semantic Web Services that represent Web Services with a semantic description about the interface and its characteristics. Most approaches split the semantic description into two parts. The first part clarifies the interpretation about the concepts used in the particular application domain. The second part refers to a definition about the elements of a Web Service, such as defining that a Web Service features input parameters or provides specific preconditions. Several proposals exist already to standardise the semantic description about Web services, such as the semantically annotated WSDL approach (WSDL-S), the OWL Services ontology and the Web Service Modelling Ontology (WSMO).
For the semantic version of the challenge, we define a simplified
version of Semantic Web Services. In 2007 WS-Challenge, the same set
domain concepts is provided in two different formats, namely XML
Schema as well as OWL. A simplified type hierarchy defined in XML
Schema (with the same format as that provided in 2006 WS-Challenge) is
provided as a common definition about the domain concepts. This type
hierarchy will provide the type definitions about the input and output
parameters of the considered Web services. The semantic description
about the provided and required services will also use a
representation that complies with the XML Schema. Consequently, we
extend the matching of parameter names to the matching of parameter
types defined by the XML Schema type hierarchy. Addition to the use of
the XML Schema, the domain concepts will
Semantical Discovery Sample A Web Service may have a number of input and output parameters each refering to a type related to a type system potentially providing an inheritance hierarchy. Considering that a Web Service represents a programming interface we need to consider the contravariance of types for the interfaces, which result in the following rules for a successful type match of parameters:
In other words, the new matching challenge does not consider the string equivalence of parameter names but the contravariance of types to identify successful matches. Please note also that the invocation of a Web Service represents a call of a software API. Thus, we must also consider:
The type system will be encoded using XML Schema. We consider XML Schema as a lightweight way to define complex types to establish a type hierarchy. In addition, we consider the information expressed by using XML Schema as easy to parse and process. Let us consider the following type example specified based on XML Schema as follows:
<complexType name="Address">
<sequence>
<element name="name" type="string" minOccurs="0"/>
<element name="street" type="string"/>
<element name="city" type="string"/>
</sequence>
</complexType>
In addition we define the following two subtypes using XML Schema:
<complexType name="US-Address">
<complexContent>
<extension base="Address">
<sequence>
<element name="state" type="US-State"/>
<element name="zip" type="positiveInteger"/>
</sequence>
</extension>
</complexContent>
</complexType>
and
<complexType name="EU-Address">
<complexContent>
<extension base="Address">
<sequence>
<element name="postcode" type="EU-Postcode"/>
</sequence>
<attribute name="export-code"
type="positiveInteger" fixed="1"/>
</extension>
</complexContent>
</complexType>
The resulting subsumes relation is as such that the concept of Address subsumes the concepts of EU-Address and US-Address in the way that both subtypes show all characteristics of the their supertype. For this example, we consider the following as successful match:
Semantical Composition Sample Along the lines of the Semantical Discovery Competition the composition competition can also be changed into a semantic version. Based on the matching rule defined above, the aim is to derive a minimal chain of services providing a match with the input and output parameter types of the query. To give and example, consider the following required service: a service requester seeks a service that returns an address for a given client name. Based on the Name type:
<complexType name="Name">
<sequence>
<element name="Lastname" type="string" minOccurs="1"/>
<element name="Firstname" type="string" minOccurs="1"/>
</sequence>
</complexType>
the following query has to be fulfilled based on the type Address introduced above:
<WSChallenge>
<CompositionRoutine name="composition1-20-16-10">
<Provided> Name </Provided>
<Resultant> Address </Resultant>
</CompositionRoutine>
</WSChallenge>
However, the repository does not contain such a service, but a service having an input parameter of type Name and an output parameter of type Clientid:
<simpleType name="Clientid">
<restriction base="string"/>
</simpleType>
In addition, the repository contains another service having an input parameter of type Clientidand an output parameter of the desired type EU-Address. Then, the two services can be composed and provide a solution to the specified query.
Query and Solution Formats The type definition specified in XML Schema is provided as a single file used by all WSDL files related to a particular repository. Besides of that the specification of the query and the the expected result format are equivalent except that
The 2007 Web Services Challenge incorporates several new aspects:
|
|
|