Redefining the RDFS Closure to be Decidable

No Thumbnail Available
Authors
Weaver, Jesse
Issue Date
2010-06-29
Type
Language
Keywords
Research Projects
Organizational Units
Journal Issue
Alternative Title
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.
Description
Full Citation
Publisher
Terms of Use
Journal
Volume
Issue
PubMed ID
DOI
ISSN
EISSN