Ada & Ontology ( OWL,RDF, JSON, dot)

Ada & Ontology ( OWL,RDF, JSON, dot)

[Peter Brooks]

Has anybody used Ada to work with ontologies?

I'll be building a new ontology soon, and I'd like one output to be Ada packages to support it. If there are existing packages that can read and interpret ontologies and exchange defined objects over defined interfaces that would save a great deal of work!

I'll be using the dot language to define the ontology initially (graphviz), then converting it to JSON and OWL - so it doesn't matter which of the three existing Ada packages handle.

If not, is there anything that supports OWL, RDF or JSON that would help with this?

Alternatively, is there a good Ada package for handling directed graphs?

Re: Ada & Ontology ( OWL,RDF, JSON, dot)

[Dmitry A. Kazakov]

On Sun, 14 Jul 2013 23:36:22 -0700 (PDT), Peter Brooks wrote:

> Alternatively, is there a good Ada package for handling directed graphs?

Well, it is difficult to provide a universal implementation of graphs.
Usually, you would needs a custom implementation.

Anyway, Simple Components has an implementation of directed and directed
weighted graphs:

http://www.dmitry-kazakov.de/ada/components.htm#directed_graphs

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de

Re: Ada & Ontology ( OWL,RDF, JSON, dot)

[Peter Brooks]

On Monday, 15 July 2013 09:14:48 UTC+2, Dmitry A. Kazakov  wrote:
> On Sun, 14 Jul 2013 23:36:22 -0700 (PDT), Peter Brooks wrote:
> 
> 
> 
> > Alternatively, is there a good Ada package for handling directed graphs?
> 
> 
> 
> Well, it is difficult to provide a universal implementation of graphs.
> 
> Usually, you would needs a custom implementation.
> 
> 
> 
> Anyway, Simple Components has an implementation of directed and directed
> 
> weighted graphs:
> 
> 
> 
> http://www.dmitry-kazakov.de/ada/components.htm#directed_graphs
> 
Thank you!

Re: Ada & Ontology ( OWL,RDF, JSON, dot)

[Randy Brukardt]

"Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> wrote in message 
news:pgggo3irufxz$.mbvohwd9o6qd.dlg@40tude.net...
> On Sun, 14 Jul 2013 23:36:22 -0700 (PDT), Peter Brooks wrote:
>
>> Alternatively, is there a good Ada package for handling directed graphs?
>
> Well, it is difficult to provide a universal implementation of graphs.
> Usually, you would needs a custom implementation.

Right. If your graph doesn't have any cycles (that is, it's a tree), then 
Ada.Containers.Multiway_Trees is the way to go (because it's part of the Ada 
Standard). Most of the data structures that I've needed can be described as 
a tree (possibility with a bit of rethinking), which is why we put that 
container into the Ada Standard.

                                 Randy.

Re: Ada & Ontology ( OWL,RDF, JSON, dot)

[Yannick Duchêne (Hibou57)]

Le Tue, 16 Jul 2013 02:35:16 +0200, Randy Brukardt <randy@rrsoftware.com>  
a écrit:

> "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> wrote in message
> news:pgggo3irufxz$.mbvohwd9o6qd.dlg@40tude.net...
>> On Sun, 14 Jul 2013 23:36:22 -0700 (PDT), Peter Brooks wrote:
>>
>>> Alternatively, is there a good Ada package for handling directed  
>>> graphs?
>>
>> Well, it is difficult to provide a universal implementation of graphs.
>> Usually, you would needs a custom implementation.
>
> Right. If your graph doesn't have any cycles (that is, it's a tree),[…]
I believe this was an oops: an acyclic graph is not necessarily a tree.

-- 
“Syntactic sugar causes cancer of the semi-colons.” [1]
“Structured Programming supports the law of the excluded muddle.” [1]
[1]: Epigrams on Programming — Alan J. — P. Yale University

Re: Ada & Ontology ( OWL,RDF, JSON, dot)

[Randy Brukardt]

[-- Warning: decoded text below may be mangled, UTF-8 assumed --]
[-- Attachment #1: Type: text/plain, Size: 1326 bytes --]

"Yannick Duchêne (Hibou57)" <yannick_duchene@yahoo.fr> wrote in message 
news:op.w0hmrfoqule2fv@cardamome...
Le Tue, 16 Jul 2013 02:35:16 +0200, Randy Brukardt <randy@rrsoftware.com>
a écrit:

> "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de> wrote in message
> news:pgggo3irufxz$.mbvohwd9o6qd.dlg@40tude.net...
>> On Sun, 14 Jul 2013 23:36:22 -0700 (PDT), Peter Brooks wrote:
>>
>>>> Alternatively, is there a good Ada package for handling directed 
>>>> graphs?
>>>
>>> Well, it is difficult to provide a universal implementation of graphs.
>>> Usually, you would needs a custom implementation.
>>
>> Right. If your graph doesn't have any cycles (that is, it's a tree),[.]
>I believe this was an oops: an acyclic graph is not necessarily a tree.

I guess you're right. I was thinking that a "join" would have to necessarily 
cause a cycle, but that isn't true if both nodes are leafs and there are 
probably more cases as well. What I *was* thinking is that the multi-way 
tree that is contained in Ada.Containers supports a lot more structures than 
just the classic binary tree, and that many (maybe most?) acyclic graphs 
that you'll encounter in practice can be mapped into it. (I've never needed 
a more complex graph than a multi-way tree in any of my programs. YMMV.)

                                        Randy.