Semantic Web

About: Semantic Web is a research topic. Over the lifetime, 26987 publications have been published within this topic receiving 534275 citations. The topic is also known as: Sem Web & SemWeb.

A scalable and ontology-based P2P infrastructure for Semantic Web Services

Abstract: Semantic Web Services are a promising combination of Semantic Web and Web service technology, aiming at providing means of automatically executing, discovering and composing semantically marked-up Web services. We envision peer-to-peer networks which allow for carrying out searches in real-time on permanently reconfiguring networks to be an ideal infrastructure for deploying a network of Semantic Web Service providers. However, P2P networks evolving in an unorganized manner suffer from serious scalability problems, limiting the number of nodes in the network, creating network overload and pushing search times to unacceptable limits. We address these problems by imposing a deterministic shape on P2P networks: We propose a graph topology which allows for very efficient broadcast and search, and we provide an efficient topology construction and maintenance algorithm which, crucial to symmetric peer-to-peer networks, does neither require a central server nor super nodes in the network. We show how our scheme can be made even more efficient by using a globally known ontology to determine the organization of peers in the graph topology, allowing for efficient concept-based search.

Representing Web graphs

Abstract: A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navigation of the Web graph. However, efficient traversal of huge Web graphs containing several hundred million vertices and a few billion edges is a challenging problem. An additional complication is the lack of a schema to describe the structure of Web graphs. As a result, naive graph representation schemes can significantly increase query execution time and limit the usefulness of Web repositories. We propose a novel representation for Web graphs, called an S-Node representation. We demonstrate that S-Node representations are highly space-efficient, enabling in-memory processing of very large Web graphs. In addition, we present detailed experiments that show that S-Node representations can significantly reduce query execution times when compared with other schemes for representing Web graphs.

Logic-based Web services composition: from service description to process model

Abstract: This paper introduces a method for automatic composition of semantic Web services using Linear Logic (LL) theorem proving. The method uses semantic Web service language (DAML-S) for external presentation of Web services, while, internally, the services are presented by extralogical axioms and proofs in LL. We use a process calculus to present the composite service formally. The process calculus is attached to the LL inference rules in the style of type theory. Thus the process model for a composite service can be generated directly from the proof. The subtyping rules that are used for semantic reasoning are presented with LL inference figures. We propose a system architecture where the DAML-S translator, the LL theorem prover and the semantic reasoner can operate together to fulfill the task. This architecture has been implemented in Java.

Embracing "Web 3.0"

Abstract: With the Resource Description Framework (RDF) and Web Ontology Language (OWL) - the languages that power the semantic Web - becoming standards and new technologies reaching maturity for embedding semantics in existing Web pages and querying RDF knowledge stores, something exciting is clearly happening in this area. Whereas the research community is widely exploiting the AI technologies that motivate, in particular, the OWL DL sublanguage, the languages' more "Webby" features - sometimes referred to as the "dark side" of the semantic Web - are powering the Web 3.0 technology space