Scalable OWL 2 reasoning for linked data

  • Authors:

  • Aidan Hogan;Jeff Z. Pan;Axel Polleres;Yuan Ren

  • Affiliations:

  • Digital Enterprise Research Institute, National University of Ireland, Galway;Department of Computing Science, University of Aberdeen;Digital Enterprise Research Institute, National University of Ireland, Galway and Siemens AG Österreich, Siemensstrasse, Vienna, Austria;Department of Computing Science, University of Aberdeen

  • Venue:
  • RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The goal of the Scalable OWL 2 Reasoning for Linked Data lecture is twofold: first, to introduce scalable reasoning and querying techniques to SemanticWeb researchers as powerful tools to make use of Linked Data and large-scale ontologies, and second, to present interesting research problems for the Semantic Web that arise in dealing with TBox and ABox reasoning in OWL 2. The lecture consists of three parts. The first part will begin with an introduction and motivation for reasoning over Linked Data, including a survey of the use of RDFS and OWL on the Web. The second part will present a scalable, distributed reasoning service for instance data, applying a custom subset of OWL 2 RL/RDF rules (based on a tractable fragment of OWL 2). The third part will present recent work on faithful approximate reasoning for OWL 2 DL. The lecture will include our implementation of the mentioned techniques as well as their evaluations. These notes provide complimentary reference material for the lecture, and follow the three-part structure and content of the lecture.