Hi,
On 6 April 2010 20:46:21 UTC+1, François Scharffe
francois.schar...@inria.fr wrote:
Hi,
OntologyDesignPatterns.org is indeed the place to discuss ontology
patterns. It's also good to know which patterns are useful in practice,
and linked-data vocab patterns are used in vocabs that are
Hi,
Have changed the subject line to clarify the discussion.
On 7 April 2010 00:14:15 UTC+1, Peter Ansell ansell.pe...@gmail.com wrote:
In the Annotation publishing pattern section there is the following statement:
It is entirely consistent with the Linked Data principles to make
statements
Hi,
Vasiliy asks an excellent question below about publishing of inferred
data. This happens to be one of the patterns on my short-list, so I
thought I'd share a draft definition here to seek comments and develop
the discussion. But I'm also interested to explore whether a focused
discussion on
Interesting exchange
Following Ian here to say that quads are not necessary. There are some
workarounds coming to mind.
Any linked data consumer can at any moment dereference the URI to sort out
the original (aka authoritative) description triples from those asserted by
some other source.
When
Hi Leigh,
Your description of the pattern is clear and accurate, I think. I only
have one comment.
For example the publisher of a SKOS vocabulary may publish transitive
relations between SKOS concepts, but opt not to include additional
properties (e.g. that every skos:prefLabel is also an
The problem is not the standard but its the process.
a webmaster should dump the data in a owl or so reasoner (or rdfs
whatever) , then pick the outcoming triples and basically hand write
those extra classes in the nice HTML template.. mmm :-)
many extra triples (subject to change if ontologies
Giovanni Tummarello wrote:
The problem is not the standard but its the process.
a webmaster should dump the data in a owl or so reasoner (or rdfs
whatever) , then pick the outcoming triples and basically hand write
those extra classes in the nice HTML template.. mmm :-)
I don't think full
On Apr 3, 2010, at 21:45 , Niklas Lindström wrote:
2010/4/3 Michael Hausenblas michael.hausenb...@deri.org:
Niklas,
While I have seen definitions of these relations made by the community
before (e.g. used directly in AtomOwl, and a complete listing made by
Ed Summers, which I
Dan Brickley wrote:
This is where the delicate tradeoffs come into play, and where we
would all benefit if there were conventions for documenting the
information needs (eg. SPARQL templates) of consuming apps.
That's a nice idea.
I wouldn't say SPARQL templates though, as that's somewhat
On 07/04/2010 14:02, Vasiliy Faronov vfaro...@gmail.com wrote:
Dan Brickley wrote:
This is where the delicate tradeoffs come into play, and where we
would all benefit if there were conventions for documenting the
information needs (eg. SPARQL templates) of consuming apps.
That's a nice
On 7 Apr 2010, at 14:35, Hugh Glaser wrote:
On 07/04/2010 14:02, Vasiliy Faronov vfaro...@gmail.com wrote:
Dan Brickley wrote:
This is where the delicate tradeoffs come into play, and where we
would all benefit if there were conventions for documenting the
information needs (eg. SPARQL
Hi,
you might find also interesting [1], an example application that acts as a
client of the backlinking service [2] mentioned by Hugh.
This application uses the OpenSpace map API to generate Ordnance Survey URIs
which are used to query the backlinking service [3]. In the data grid all the
All,
We are proud to announce the first International Hacking RDF with Perl
Hackathon in Oslo in Norway from the 19th to the 21st of April 2010. Note
that we have moved the event to Oslo from Geilo and that it is now a pure
Perl+RDF hacking event.
These prominent Perl hackers are leading the
13 matches
Mail list logo
