Computing Boundaries for Reasoning in Sub-Ontologies

Consider an ontology T where every axiom is labeled with an element of a lattice (L,≤). Then every element ` of L determines a sub-ontology T`, which consists of the axioms of T whose labels are greater or equal to `. These labels may be interpreted as required access rights, in which case T` is the sub-ontology that a user with access right ` is allowed to… CONTINUE READING