Search Mailing List Archives
[protege-owl] Shortest path algorithm
swt at stanford.edu
Tue Aug 21 11:45:11 PDT 2007
I don't know of any implementation of shortest-path algorithm for
Protege ontology or knowledge base. It would be great if you can
implement such algorithm for various graph structures in Protege. For
example, you can look at distance between classes along
asserted/inferred subclass/superclass relationships, or distance between
individuals by following some set of property relationships.
Abolghasem Sadeghi wrote:
> *Dear Sir or Madam,*
> * *
> I would like to cordially ask the following research question about
> designing shortest path algorithm in ontology.
> Actually, I can explain in detail what I am going to do. In my research,
> I want to implement a route finding algorithm such as Dijkstra's
> algorithm by protégé[in owl format or RDF] in my new model. Would you
> please let me know is there any ready source protégé code in ontology
> format for shortest path algorithm?
> Very thank you in advance.
Samson Tu email: swt at stanford.edu
Senior Research Scientist web: www.stanford.edu/~swt/
Stanford Medical Informatics phone: 1-650-725-3391
Stanford University fax: 1-650-725-7944
More information about the protege-owl