Simple and Efficient Minimal RDFS

  • Authors:
  • Sergio Muñoz;Jorge Pérez;Claudio Gutierrez

  • Affiliations:
  • Department of Mathematics, Universidad Chile, Chile;Department of Computer Science, Pontificia Universidad Católica de Chile, Chile and Khipu: South Andean Center for Database Research, Chile;Department of Computer Science, Universidad Chile, Chile and Khipu: South Andean Center for Database Research, Chile

  • Venue:
  • Web Semantics: Science, Services and Agents on the World Wide Web
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The original RDFS language design includes several features that hinder the task of developers and theoreticians. This paper has two main contributions in the direction of simplifying the language. First, it introduces a small fragment which, preserving the normative semantics and the core functionalities, avoids the complexities of the original specification, and captures the main semantic functionalities of RDFS. Second, it introduces a minimalist deduction system over this fragment, which by avoiding certain rare cases, obtains a simple deductive system and a computationally efficient entailment checking.