- From: Adrian Walker <adriandwalker@gmail.com>
- Date: Tue, 10 Apr 2007 21:10:23 -0400
- To: "Cristina Lancioni, Doctor in Computer Science" <cristina.lancioni@unicam.it>, semantic-web@w3.org
Received on Wednesday, 11 April 2007 01:10:27 UTC
Hi Cristina -- By way of background on this subject, you may be interested in www.reengineeringllc.com/demo_agents/RDFQueryLangComparison1.agent and in the underlying online system [1], which does support recursive queries. HTH, -- Adrian [1] Internet Business Logic (R) A Wiki for Executable Open Vocabulary English Online at www.reengineeringllc.com Shared use is free Adrian Walker Reengineering On 4/10/07, Cristina Lancioni, Doctor in Computer Science < cristina.lancioni@unicam.it> wrote: > > > Hello, > I'm a phd student in Information Technology at the > University of Camerino (Italy). > I would like to know if it's possible to do recursive > queries in SPARQL. > In fact I've this problem. I've an ontology in OWL with > only relations is-a. This ontology is made like a tree. I > would like to select a subgraph made of the path from the > leaf node to the root node (result example: A(leaf) is-a B > is-a C is-a D(root)). > How could I do this using only a single query? Shoud I do > this with SPARQL? If not, do You know another ontology > query language to do this? > > Please reply. > Thanks. > Regards. > Cristina Lancioni. > > >
Received on Wednesday, 11 April 2007 01:10:27 UTC