• Login
    View Item 
    •   DSpace@RPI Home
    • Tetherless World Constellation
    • Tetherless World Publications
    • View Item
    •   DSpace@RPI Home
    • Tetherless World Constellation
    • Tetherless World Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Redefining the RDFS Closure to be Decidable

    Author
    Weaver, Jesse
    Thumbnail
    Other Contributors
    Date Issued
    2010-06-29
    Degree
    Terms of Use
    Metadata
    Show full item record
    URI
    http://www.cs.rpi.edu/~weavej3/papers/rdfn2010.pdf; https://hdl.handle.net/20.500.13015/4620
    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.;
    Department
    Relationships
    Access
    Collections
    • Tetherless World Publications

    Browse

    All of DSpace@RPICommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2022  DuraSpace
    Contact Us | Send Feedback
    DSpace Express is a service operated by 
    Atmire NV