Show simple item record

dc.contributor.authorWeaver, Jesse
dc.date.accessioned2022-02-18T02:38:16Z
dc.date.available2022-02-18T02:38:16Z
dc.date.issued2010-06-29
dc.identifier.other218
dc.identifier.urihttp://www.cs.rpi.edu/~weavej3/papers/rdfn2010.pdf
dc.identifier.urihttps://hdl.handle.net/20.500.13015/4620
dc.description.abstractIn 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.
dc.titleRedefining the RDFS Closure to be Decidable


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record