In PROLOG you can represent and query a connect graph, as in this tutorial:
http://www.csupomona.edu/~jrfisher/www/prolog_tutorial/2_15.html
How would you do this using an OWL/RDL tool such as Protégé (http://protege.stanford.edu/)?
In PROLOG you can represent and query a connect graph, as in this tutorial:
http://www.csupomona.edu/~jrfisher/www/prolog_tutorial/2_15.html
How would you do this using an OWL/RDL tool such as Protégé (http://protege.stanford.edu/)?
I believe you can achieve this by using a semantic reasoner, such as Racer Pro (non-free) and Pellet (free, open source if under used in an open source project).
This wikipedia page gives a comprehensive list of reasoners available with a comparison table.