Navigation

dl as RDF Graphs

An OWL Full document [Add definition and link] is an OWL dl Ontology if and only if the imports closure of the RDF graph meets the following conditions:

1. For every node of the graph and every URI reference used as a property or datatype at least one of the following holds:
   • It is one of the built-in URI references from RDF, RDFS, OWL or XML Schema datatypes.
   • It is the subject of at least one triple with predicate rdf:type, and with object other than rdf:Property, rdfs:Class, owl:FunctionalProperty, owl:DeprecatedProperty, owl:DeprecatedClass. The objects of such triples are known as the explicit types of the subject.
   • It is a literal.
2. No blank node occurs as the object of more than one triple.
3. No directed cycle of blank nodes occurs.
4. Every blank node with explicit type rdf:List is the object of exactly one triple.
5. Every builtin uriref is assigned to one of its listed categories, or to itself.
6. Every other uriref is assigned to one of the following categories:
   • ontologyID
   • datatypeID
   • annotationPropID
   • dataAnnotationPropID
   • classID
   • individualID
   • dataPropID
   • objectPropID
   • transitivePropID
7. Every blank node is assigned to one of the following categories:
   • allDifferent
   • description
   • listOfDataLiteral
   • listOfDescription
   • listOfIndividualID
   • restriction
   • unnamedDataRange
   • unnamedIndividual
8. With the given category assignments every triple in the graph appears in one of the following tables:
   • Main table
   • blank nodes of category allDifferent
   • blank nodes of category description
   • blank nodes of category listOfDataLiteral
   • blank nodes of category listOfDescription
   • blank nodes of category listOfIndividualID
   • blank nodes of category restriction
   • blank nodes of category unnamedDataRange
9. A blank node may be the subject of at most one triple matching in the auxilliary table, in which case it must not be the object of any triple.
10. Every blank node is either of category unnamedIndividual or meets the structural requirements listed below, in the appropriate table.

Such an RDF graph is finite, being constructed from a finite number of finite documents.

A directed cycle of blank nodes is a sequence of triples t0, t1, ... tn, in which tn = t0, and in which the subjects and objects of all the triples are blank, and in which the object of ti is the subject of ti+1, for i from 0 to n-1.

dl Triple Table

Rules for Blank Nodes of Category allDifferent

Every node of category allDifferent must fit the following pattern. For each such node, exactly one instance of each triple in the pattern must be present in the graph. There are no other triples in the graph in which such nodes are subjects.

Rules for Blank Nodes of Category description

Every node of category description must fit one of these patterns. For each such node, exactly one instance of each triple in the pattern must be present in the graph. There may be additional triples in which such nodes are subjects as listed in the main triple tables.

Rules for Blank Nodes of Category listOfDataLiteral

Every node of category listOfDataLiteral must fit the following pattern. For each such node, exactly one instance of each triple in the pattern must be present in the graph. There are no other triples in the graph in which such nodes are subjects.

Rules for Blank Nodes of Category listOfDescription

Every node of category listOfDescription must fit the following pattern. For each such node, exactly one instance of each triple in the pattern must be present in the graph. There are no other triples in the graph in which such nodes are subjects.

Rules for Blank Nodes of Category listOfIndividualID

Every node of category listOfIndividualID must fit the following pattern. For each such node, exactly one instance of each triple in the pattern must be present in the graph. There are no other triples in the graph in which such nodes are subjects.

Rules for Blank Nodes of Category restriction

Every node of category restriction must fit one of these patterns. For each such node, exactly one instance of each triple in the pattern must be present in the graph. There may be additional triples in which such nodes are subjects as listed in the main triple tables.

Rules for Blank Nodes of Category unnamedDataRange

Every node of category unnamedDataRange must fit the following pattern. For each such node, exactly one instance of each triple in the pattern must be present in the graph. There may be additional triples in which such nodes are subjects as listed in the main triple tables.