Results 1 - 10
of
398
From SHIQ and RDF to OWL: The Making of a Web Ontology Language
- Journal of Web Semantics
, 2003
"... The OWL Web Ontology Language is a new formal language for representing ontologies in the Semantic Web. OWL has features from several families of representation languages, including primarily Description Logics and frames. OWL also shares many characteristics with RDF, the W3C base of the Semantic W ..."
Abstract
-
Cited by 615 (39 self)
- Add to MetaCart
(Show Context)
The OWL Web Ontology Language is a new formal language for representing ontologies in the Semantic Web. OWL has features from several families of representation languages, including primarily Description Logics and frames. OWL also shares many characteristics with RDF, the W3C base of the Semantic Web. In this paper we discuss how the philosophy and features of OWL can be traced back to these older formalisms, with modifications driven by several other constraints on OWL. Several interesting problems...
Bringing Semantics to Web Services: The OWL-S Approach
, 2004
"... Abstract. Service interface description languages such as WSDL, and related standards, are evolving rapidly to provide a foundation for interoperation between Web services. At the same time, Semantic Web service technologies, such as the Ontology Web Language for Services (OWL-S), are developing the ..."
Abstract
-
Cited by 168 (9 self)
- Add to MetaCart
(Show Context)
Abstract. Service interface description languages such as WSDL, and related standards, are evolving rapidly to provide a foundation for interoperation between Web services. At the same time, Semantic Web service technologies, such as the Ontology Web Language for Services (OWL-S), are developing the means by which services can be given richer semantic specifications. Richer semantics can enable fuller, more flexible automation of service provision and use, and support the construction of more powerful tools and methodologies. Both sets of technologies can benefit from complementary uses and crossfertilization of ideas. This paper shows how to use OWL-S in conjunction with Web service standards, and explains and illustrates the value added by the semantics expressed in OWL-S. 1
Automated Semantic Web Service Discovery with OWLS-MX
, 2006
"... We present an approach to hybrid semantic Web service matching that complements logic based reasoning with approximate matching based on syntactic IR based similarity computations. The hybrid matchmaker, called OWLS-MX, applies this approach to services and requests specified in OWL-S. Experimental ..."
Abstract
-
Cited by 128 (14 self)
- Add to MetaCart
We present an approach to hybrid semantic Web service matching that complements logic based reasoning with approximate matching based on syntactic IR based similarity computations. The hybrid matchmaker, called OWLS-MX, applies this approach to services and requests specified in OWL-S. Experimental results of measuring performance and scalability of different variants of OWLS-MX show that under certain constraints logic based only approaches to OWL-S service I/O matching can be significantly outperformed by hybrid ones.
Composing Web Services on the Semantic Web
- The VLDB Journal
, 2003
"... Abstract. Service composition is gaining momentum as the potential silver bullet for the envisioned Semantic Web. It purports to take the Web to unexplored efficiencies and provide a flexible approach for promoting all types of activities in tomorrow’s Web. Applications expected to heavily take adva ..."
Abstract
-
Cited by 113 (5 self)
- Add to MetaCart
(Show Context)
Abstract. Service composition is gaining momentum as the potential silver bullet for the envisioned Semantic Web. It purports to take the Web to unexplored efficiencies and provide a flexible approach for promoting all types of activities in tomorrow’s Web. Applications expected to heavily take advantage of Web service composition include B2B E-commerce and E-government. To date, enabling composite services has largely been an ad hoc, time-consuming, and error-prone process involving repetitive low-level programming. In this paper, we propose an ontology-based framework for the automatic composition of Web services. We present a technique to generate composite services from high-level declarative descriptions. We define formal safeguards for meaningful composition through the use of composability rules. These rules compare the syntactic and semantic features of Web services to determine whether two services are composable. We provide an implementation using an E-government application offering customized services to indigent citizens. Finally, we present an exhaustive performance experiment to assess the scalability of our approach.
WSMX - a semantic service-oriented architecture
- In Proceedings of the International Conference on Web Service (ICWS 2005
, 2005
"... Web Services offer an interoperability model that abstracts from the idiosyncrasies of specific implementations; they were introduced to address the increasing need for seamless interoperability between systems in the Businessto-Business domain. We analyse the requirements from this domain and show ..."
Abstract
-
Cited by 89 (10 self)
- Add to MetaCart
(Show Context)
Web Services offer an interoperability model that abstracts from the idiosyncrasies of specific implementations; they were introduced to address the increasing need for seamless interoperability between systems in the Businessto-Business domain. We analyse the requirements from this domain and show that to fully address interoperability demands we need to make use of semantic descriptions of Web Services. We therefore introduce the Web Service Execution Environment (WSMX), a software system that enables the creation and execution of Semantic Web Services based on the Web Service Modelling Ontology. Providers can use it to register and offer their services and requesters can use it to dynamically discover and invoke relevant services. WSMX allows a requester to discover, mediate and invoke Web Services in order to carry out its tasks, based on services available on the Internet. 1
A System for Principled Matchmaking in an Electronic Marketplace
, 2003
"... More and more resources are becoming available on the Web, and there is a growing need for infrastructures that, based on advertised descriptions, are able to semantically match demands with supplies. We formalize general properties a matchmaker should have, then we present a matchmaking facilitator ..."
Abstract
-
Cited by 88 (41 self)
- Add to MetaCart
(Show Context)
More and more resources are becoming available on the Web, and there is a growing need for infrastructures that, based on advertised descriptions, are able to semantically match demands with supplies. We formalize general properties a matchmaker should have, then we present a matchmaking facilitator, compliant with desired properties. The system embeds a NeoClassic reasoner, whose structural subsumption algorithm has been modified to allow match categorization into potential and partial, and ranking of matches within categories. Experiments carried out show the good correspondence between users and system rankings.
The Instance Store: Dl reasoning with large numbers of individuals
- IN PROC. OF THE 2004 DESCRIPTION LOGIC WORKSHOP (DL 2004
, 2004
"... We present an application -- the Instance Store -- aimed at solving some of the scalability problems that arise when reasoning with the large numbers of individuals envisaged in the semantic web. The approach uses well-known techniques for reducing description logic reasoning with individuals to ..."
Abstract
-
Cited by 78 (7 self)
- Add to MetaCart
We present an application -- the Instance Store -- aimed at solving some of the scalability problems that arise when reasoning with the large numbers of individuals envisaged in the semantic web. The approach uses well-known techniques for reducing description logic reasoning with individuals to reasoning with concepts. Crucial to the implementation is the combination of a description logic terminological reasoner with a traditional relational database. The resulting form of inference, although specialised, is sound and complete and sufficient for several interesting applications. Most importantly, the application scales to sizes (over 100,000s individuals) where all other existing applications fail. This claim is substantiated by a detailed empirical evaluation of the Instance Store in contrast with existing alternative approaches.
Concept abduction and contraction for semantic-based discovery of matches and negotiation spaces in an e-marketplace
, 2005
"... ..."
Filtering and selecting Semantic Web Services with Interactive Composition Techniques,
- IEEE Intelligent Systems, July/August
, 2004
"... ..."
Automatic location of services
- In Proceedings of the 2nd European Semantic Web Conference (ESWC 2005
, 2005
"... Abstract. The automatic location of services that fulfill a given need is seen as a key step towards dynamic and scalable integration. In this paper we present a model for the automatic location of services that considers the static and dynamic aspects of service descriptions and identifies what not ..."
Abstract
-
Cited by 57 (10 self)
- Add to MetaCart
(Show Context)
Abstract. The automatic location of services that fulfill a given need is seen as a key step towards dynamic and scalable integration. In this paper we present a model for the automatic location of services that considers the static and dynamic aspects of service descriptions and identifies what notions of match and techniques are useful for the matching of both. Our model presents three important features: ease of use for the requester, efficient pre-filtering of relevant services, and accurate contracting of services that fulfill a given requester goal. We further elaborate previous work and results on Web service discovery by analyzing what steps and what kind of descriptions are necessary for an efficient and usable automatic service location. Furthermore, we analyze the intuitive and formal notions of match that are of interest for locating services that fulfill a given goal. Although having a formal underpinning, the proposed model does not impose any restrictions on how to implement it for specific applications, but proposes some useful formalisms for providing such implementation. 1
