06.07.2014, 23:05, "Simon Spero" <sesuncedu@gmail.com>:
[I'mš not sure if the original poster is looking to construct trees of rdf statements, represent trees in rdf, or represent n-ary predicates. The last requires creating a new object.š Some patterns for doing this are described in [2] (this note predates OWL 2.0, so HasKey axioms were not available).]
š
The thing I want is to convert RDF structures like Turtle examples in my draft:
š
š
into an Ada (or you can think about an other programming language) data structure (tree in fact) which should be easy to work with programatically.
š
In the examples there are anonymous nodes, which should be get rid of as they are not an inherent part of the tree structure.
š
By the way the structure can be validated, for example not allowing >1 childs when there must be 0..1 childs, and like this.
š
It seems that nobody has done this highly useful programming job. So I am going to do it in Ada (after I finish Ada bindings for librdf). Someone should afterward rewrite my Ada code into other programming languages).
š
--
Victor Porton - http://portonvictor.org
š