Redefining the RDFS Closure to be Decidable

Printer-friendly version

Citation: Weaver, J. 2010. Redefining the RDFS Closure to be Decidable. In Proceedings of W3C Workshop on RDF Next Steps (June 26-27 2010June 26-27 2010June 26-27 2010, Palo Alto, CAPalo Alto, CA, USA).

Presented at the W3C Workshop on RDF Next Steps

Authors:Jesse Weaver

Abstract:

In this position paper, I review a problem with the way the current RDF Semantics defines the RDFS closure. In particular, the concern is with the treatment of container membership properties which causes the RDFS closure to be infinite. This problem has been known for over half a decade. I present some statistics on the usage of container membership properties that suggest that container membership properties are used widely enough to advocate continued support and thus modification to the definition of the RDFS closure. I look at some previously suggested solutions and then propose a solution which involves adding four rules to the RDFS entailment rules and removing some RDF and RDFS axiomatic triples.