W3C home > Mailing lists > Public > semantic-web@w3.org > April 2007

Re: Question about ontology query languages... (please reply!!!)

From: Richard H. McCullough <rhm@PioneerCA.com>
Date: Wed, 11 Apr 2007 09:07:09 -0700
Message-ID: <00fa01c77c53$906bc460$6401a8c0@rhm8200>
To: "Cristina Lancioni, Doctor in Computer Science" <cristina.lancioni@unicam.it>, <semantic-web@w3.org>

This query capability is built into the mKR language (http://mKRmKE.org/).
For your example, the query is

    A  isa*  ?;

Dick McCullough
mKE do enhance od "Real Intelligence" done;
knowledge := man do identify od existent done;
knowledge haspart proposition list;
http://mKRmKE.org/

----- Original Message ----- 
From: "Cristina Lancioni, Doctor in Computer Science" 
<cristina.lancioni@unicam.it>
To: <semantic-web@w3.org>
Sent: Tuesday, April 10, 2007 6:10 AM
Subject: Question about ontology query languages... (please reply!!!)


>
> 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 16:08:50 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 21:45:14 GMT