Overview of RDFS++

Description logic or OWL reasoners are good at handling (complex) ontologies, they are usually complete (give all the possible answers to a query) but totally unpredictable with respect to execution time when the number of individuals increases beyond millions.

AllegroGraph's RDFS++ reasoning supports all the RDFS predicates and some of OWL's. It is not complete but it has predictable and fast performance. Here are the supported predicates:

• rdf:type
• rdfs:subClassOf
• rdfs:domain and rdfs:range
• rdfs:subPropertyOf
• owl:sameAs
• owl:inverseOf
• owl:TransitiveProperty

Up | Next

© 2008 Franz Inc - Privacy Statement
[ Consulting Services | Franz | TopQuadrant | Racer Systems ]