${N3}_{\mathrm{terms}}≔\{\mathrm{URIs},\exists (\mathrm{existential}\mathrm{variables}),\mathrm{Literals},\forall (\mathrm{universal}\mathrm{variables}),\mathrm{Formula}\mathrm{nodes}\}$

${N3}_{\mathrm{nonLiterals}}≔{N3}_{\mathrm{terms}}$ $-{\mathrm{Literals}}_{}$

${N3}_{\mathrm{graphNames}}≔\{\mathrm{URIs},\exists ,\mathrm{Formula}\mathrm{nodes}\}$

${N3}_{\mathrm{predicateNames}}$ $≔{N3}_{\mathrm{terms}}-\{\mathrm{Literals},\exists \}$

${N3}_{\mathrm{classNames}}$ $≔{N3}_{\mathrm{nonLiterals}}-\mathrm{Formula}\mathrm{nodes}$

${N3}_{\mathrm{nonLiterals}}$and${\mathrm{Literals}}_{}$can be interned and persisted disjointly as two tables with primary keys (using hash functions such as SHA-1 and MD5).

The entire Knowledge Base can be partition into 3 disjoint relations:

I. (Description Logics ABox) $≔\{(M,C,G):P(M,C,G)\}$

$C\in {N3}_{\mathrm{classNames}},M\in {N3}_{\mathrm{nonLiterals}},G\in {N3}_{\mathrm{graphNames}}$

where: P is rdf:type, M is a member of the class C, and G is the name of the graph in which the class membership assertion is made.

II. (Literal Properties) $≔\{(S,P,V,D,L,G):P(S,L,G)\}$

$S\in {N3}_{\mathrm{nonLiterals}},P\in {N3}_{\mathrm{predicateNames}},V\in \mathrm{Literal},D\in \mathrm{URIs}$

$G\in {N3}_{\mathrm{graphNames}},L\in \{l:l\mathrm{is}a\mathrm{language}\mathrm{tag}\}$

where: P is the named property, S is the subject of the property, V is the literal value of the property, D (optional) is the datatype associated with the literal, L is the language in which the literal is expressed, and G is the name of the graph in which the property is asserted

III. (All other relations) $≔$$\{(S,P,O,G):P(S,O,G)\}$

$S\in {N3}_{\mathrm{nonLiterals}},P\in {N3}_{\mathrm{predicateNames}},O\in {N3}_{\mathrm{nonLiterals}},G\in {N3}_{\mathrm{graphNames}}$ $$

where: P is the named relationships, S is the subject of the relation, O is the object of the relation, and G is the name of the graph in which the relationship is asserted