Ontology Compression

Dear all,

I am curious about ontology compression techniques. Suppose I have the following ontology:

:Lawyer rdf:type owl:Class ;        
        rdfs:subClassOf :Person .

:LivingThing rdf:type owl:Class .

:Person rdf:type owl:Class ;
rdfs:subClassOf :LivingThing .

:sophia rdf:type :Lawyer ,
:LivingThing ,
:Person ,
owl:NamedIndividual ,
owl:Thing .

I realize that we actually can compress the ontology (ABox), to only contain:

:sophia rdf:type :Lawyer

Since it is the minimal ABox that could infer other facts (Sophia is a Person, etc). I know this is a very basic example. However, I don't know what this technique is called. It seems like I do the usual ontology inference but in backward direction. Any references? Thanks a lot!

Another related paper about minimisation of RDF graphs (as well as rule-sets, etc.):

Reinhard Pichler, Axel Polleres, Sebastian Skritek, Stefan Woltran: Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. RR 2010: 133-148