search

EmmanuelOga / hypergraphdb

Automatically exported from code.google.com/p/hypergraphdb
1 stars 0 forks source link

Recursive incidence set traversal support needed for OWL-API HG #66

Open GoogleCodeExporter opened 9 years ago

GoogleCodeExporter commented 9 years ago 
In the Owl-API HG implementation we have Ontologies that contain Axioms. Some 
Axioms use cascaded ClassExpressions that contain Entities.

Ontologies are realized as Subgraphs containing Axioms. Axioms and 
ClassExpressions are Links, Entities 0-ary Atoms. ClassExpressions may link to 
ClassExpressions and/or Entities. 
e.g. Axiom A1 -> ClsExprA11 -> ClsExprA12 -> ClsExprA12 -> Entity E.
     Axiom A2 -> Entity E.
     Axiom AN -> ClsExprANN -> Entity E.

* How can we find all Axioms A1..An in one Ontology O that directly or 
indirectly refer (link) to Entity E?

If we start with the incidenceSet I of one entity E and recursively visit all 
incident atoms (Type: ClassExpression or Axiom) linking to the entity, we will 
eventually visit all Axioms refering to our entity E.

Our way to implement this using the current HG-API was by recursively using 
graph.getIncidenceSet(entity) and testing the atoms (type, et.c) in the set one 
by one and the axioms for membership in O. 
There could be a more natural way to describe this using the HG Query API or 
graph traversal classes.

Version: Trunk on day of report.

Original issue reported on code.google.com by thomas.h...@gmail.com on 20 Oct 2011 at 9:06