Re: RDFa in HTML5

[Niklas Lindström]

Hi again,

I also had some thoughts about the general vocabulary usage in your
page. This is a bit more speculative, but I hope it can give you some
ideas.

On Wed, Jan 4, 2012 at 11:08 AM, Augusto Herrmann
 wrote:
> The examples are displayed as (escaped) html code in the rightside
> panel on the following page: http://vocab.e.gov.br/2011/03/vcge
>
> People are meant to copy/paste the code, or just read and undestand,
> in order to learn how to mark up their own pages stating that it's
> about a subject in this controlled vocabulary. That's why we left the
> reference to the page as an empty relative URL (which should resolve
> to whatever address the page is loaded into).
>
> But we also did eat our own dog food: that page also states it's about
> the VCGE controlled vocabulary, by using RDFa 1.1 and Microdata like
> this (lines 21-25):
>
> 
>  http://purl.org/dc/terms/subject";
> content="http://vocab.e.gov.br/2011/03/vcge#esquema"; />
>
> 
>  http://schema.org/about";
> content="http://vocab.e.gov.br/2011/03/vcge#esquema"; />
>
> The triple that should be extracted from the RDFa is:
>
>  dcterms:subject
>  .

[See my previous mail for using  + @href instead of  + @content.]


In RDFa (1.0 and 1.1) it is explicitly allowed to use several
predicates at once (in @property, @rel and @rev) to provide consumers
limited to certain vocabularies with triples directed specifically
towards them (similarly you can use multiple classes in @typeof). So
to cater both for consumers who only understand schema.org terms and
consumers of Dublin Core, FOAF etc. -- at this stage of the web data
evolution -- it may be good to publish all triples you expect to be
relevant for your intended audiences. E.g. like:

http://schema.org/about";
href="http://vocab.e.gov.br/2011/03/vcge#esquema"; />

While this isn't the limited form called Lite, that form of RDFa is
targeted towards *publishers* with limited needs of RDFa. Thus, if
your publishing needs also include consumers of DC and FOAF, and you
don't wish to repeat things, I'd expect this form to be preferable.
(It all depends on the consumer needs and requirements of scalable
usage.)

Notice also that any schema.org predicates and classes can really be
used everywhere. That is, they are possible to use in any RDFa (i.e.
any RDF). Although the schema.org URIs do not resolve to data in RDF
directly (which admittedly is a requirement for proper linked data
vocabularies), schema.org do host an OWL definition of them at [1].
The schema.org ontology doesn't define a semantic equivalence between
e.g.  and 
though. But it's not unreasonable to expect some relation to that
(and/or foaf:primarySubject), ideally formally stated in the future.
See [2], especially [3] and e.g. [4] for more on that.

RDFa 1.1 specifies a form of vocabulary expansion using a subset of
the OWL semantics at [5], which can be leveraged in different ways
depending both on used vocabularies, and *especially* on the
capability of consumers. Note that this is an *optional* feature of
RDFa 1.1 processors! So don't expect the general search engines to
support these things today. Hopefully though they will come to
understand more vocabulary semantics and interlinking over time, and
also that even more vocabularies and data publishers will leverage
these semantics. This will prevent reinvention and "babelification",
enable reusable and mixable data vocabularies on a general level, and
support generally compatible specialization where needed.

Best regards,
Niklas

[1]: http://schema.org/docs/schemaorg.owl
[2]: http://schema.rdfs.org/
[3]: http://schema.rdfs.org/mappings.html
[4]: http://wiki.dublincore.org/index.php/Schema.org_Alignment/Mappings
[5]: http://www.w3.org/TR/2011/WD-rdfa-core-20111215/#s_vocab_expansion

Re: RDFa in HTML5

[Niklas Lindström]

Hello Augusto!

On Wed, Jan 4, 2012 at 11:08 AM, Augusto Herrmann
 wrote:
> The examples are displayed as (escaped) html code in the rightside
> panel on the following page: http://vocab.e.gov.br/2011/03/vcge
>
> People are meant to copy/paste the code, or just read and undestand,
> in order to learn how to mark up their own pages stating that it's
> about a subject in this controlled vocabulary. That's why we left the
> reference to the page as an empty relative URL (which should resolve
> to whatever address the page is loaded into).
>
> But we also did eat our own dog food: that page also states it's about
> the VCGE controlled vocabulary, by using RDFa 1.1 and Microdata like
> this (lines 21-25):
>
> 
>  http://purl.org/dc/terms/subject";
> content="http://vocab.e.gov.br/2011/03/vcge#esquema"; />

Using meta with @content like this produces a literal, so from the
above you'll get:

 dc:subject
"http://vocab.e.gov.br/2011/03/vcge#esquema"@pt_br .

, i.e. a literal (notice that it's also tagged with the language
"pt_br", inherited from @lang in the html element).

Verify this with e.g. the RDFa 1.1 distiller at [1].


> 
>  http://schema.org/about";
> content="http://vocab.e.gov.br/2011/03/vcge#esquema"; />
>
> The triple that should be extracted from the RDFa is:
>
>  dcterms:subject
>  .

To get this triple, you should use:

http://purl.org/dc/terms/subject";
href="http://vocab.e.gov.br/2011/03/vcge#esquema"; />

(or @property instead of @rel, since RDFa 1.1 allows them to work the
same when used in conjunction with @href or @resource).

Think of the literal resulting from the meta element as a "value
primitive", and the link as a proper *reference* to a resource which
can be the subject of more triples. (There's more theory to it than
that, but I hope it explains some of it.)

Best regards,
Niklas

[1]: http://www.w3.org/2007/08/pyRdfa/Shadow.html


> Best regards,
> Augusto Herrmann
> Open Data Team
> Ministry of Planning, Budget & Management - Brazil

Re: What do you get when you dereference the URI of a named graph?

[Kjetil Kjernsmo]

On Wednesday 4. January 2012 15.24.16 Frans Knibbe | Geodan wrote:
> Hello,
> 
> I have a (hopefully) simple question: What can you expect when you
> dereference the URI of a named graph?

This working draft sort of answers that question:
http://www.w3.org/TR/sparql11-http-rdf-update/

but as Ivan said, it isn't very clear and I think that document tries to make 
something that is actually quite nebolous very rigorous and failing. :-)

Best,

Kjetil

Re: What do you get when you dereference the URI of a named graph?

[Tim Berners-Lee]

Frans,

I don't find (as I have said many times before) the term "named graph" useful,
and this is one example of why.   A graph (in N3, say) is a value, like a 
string.

Documents, on the other hand, have URIs, and when you look up those
URIs you get back RDF (like turtle) which you can parse to a graph.

cwm for example does this lookup.  It calls the built-in function which maps a 
document
information resource) onto its semantics as an RDF (or N3) graph log:semantics.
http://www.w3.org/2000/10/swap/log#semantics

So "http://www.w3.org/2000/10/swap/log"; is a string,
< http://www.w3.org/2000/10/swap/log> is a document, and 

{  [...]
  log:semantics a rdf:Property;
 :comment """The log:semantics of a document is [...] """;
 :domain doc:Work;
 :label "semantics";
 :range log:Formula .
  [...]
}

is a graph which is related to the document by log:semantics.

You can think of log:semantics as "all the triples that belong to that graph 
representing the document x"
That's in the cwm ontology.

Of course, there are many ways in which this is simplistic, as
you can have documents whose log:semantics varies with time, and so on,
and don't even start discussing wether the localid "semantics" was a
good one to pick back then.  

The log: ontology also has functions relating a graph to a string etc.

If you really want to give a name to a graph then you can with owl:sameAs
('=' in Turtle) I suppose,  like in n3 document  say

<#g1> = {   <#s> <#p> 123 } .

and in this case when you look up  you will get all the
triples in foo.n3, not just the one above.  
You will get all the triples the author of  decided to make available.

When you use "foo.n3#g1" as an identifier for the graph, in talking to someone 
else,
 then you do it knowing that the other person will get that info in   
if they
look it up.   

Of course, in tis sense, many people can given URIs to the same graph, say in 



<#answer4> = { 123 } .

so that the same graph can have many URIs.

When SPARQL uses the syntax like  "GRAPPH "I take that 
as being a shorthand for saying the graph you would get by getting the document 
.  ((In n3 you would write that out as  [is log:semantics of  ] 
or as
^log:semantics )).

The graph isn't being directly named, a document is.
Of course loosely people muddle them in common parlance, but in general I
come back to not liking the term "named graph".   The thing in curly braces
can be called a graph literal.

Simple, in fact, yes.

Tim

On 2012-01 -04, at 09:24, Frans Knibbe | Geodan wrote:

> Hello,
> 
> I have a (hopefully) simple question: What can you expect when you 
> dereference the URI of a named graph?
> 
> I would expect the answer to be "all the triples that belong to that graph", 
> but I  could not find a source for such a mandate or consensus.
> 
> Thanks in advance,
> Frans
> 
> 
> 
> 

[CFP] Workshop on Down Scaling the Semantic Web at ESWC 2012

[Christophe Guéret]

[Apologies for cross-posting]


First International Workshop on Downscaling the Semantic Web - DownScale2012
http://worldwidesemanticweb.wordpress.com/downscale2012/
May 27-28, 2012

co-located with the 9th Extended Semantic Web conference
May 27-31, 2012, Heraklion, Greece


= Objectives of the workshop =

Our current mind set as Semantic Web engineers is to focus on 
centralized and

very powerful solutions centred (and depending on ...) around Web hosted
servers and (mobile) clients accessing it. As a direct consequence of 
that, the

usage of Linked Data depends on the availability of a Web infrastructure
compassing data-centers, high speed reliable Internet connection and modern
client devices. If any of this is missing, our community is not able, 
yet, to
provide any Linked Data enabled data management solution. Still, the 
digital
divide that is currently widely recognized separates the world into 
those who

have access to Web-based platforms and those who don’t.
When designing Linked Data platforms we tend to forget those 4 Billion 
persons

who don’t have access to Internet but would benefit from being able to use
Linked Data.We should keep everyone in mind when we design Linked Data 
platforms

and aim at helping to reduce this digital divide.

This workshop, organised around a morning of presentations and an hacking
afternoon, as for objective to discuss the steps to take to lower the
requirements for deploying Semantic Web technologies. For instance, making
Semantic Web platforms usable under limited computing power and limited 
access
to Internet. During the hacking session, a specific focus will be put on 
the

usage of Semantic Web technology for educational software.

= Topics =

Topics of the workshop include, but are not limited to:
* Off-line linked data synchronisation
* Low resource demanding triple stores
* Application of Semantic Web to disaster data management
* Innovative linked data interfaces for illiterate and/or young users
* De-centralised data management platforms
* Collaborative, de-centralised, educational software

= Program =

* Morning: discussions
  Presentations and discussions around the need for Down scaling the 
Semantic

  Web and the challenges implied.
* Afternoon: hacking session
  Implementation of Semantic Web enabled software using the toolkits of 
Sugar
  and SemanticXO. Deployment of these applications on devices such as 
the XO

  laptop and other small hardware such as Sheevaplug.

= Submissions =

We welcome short papers that present down-scaled revisions of previously
published systems as well as position and systems paper presenting novel 
ideas.
Papers are expected not to exceed 8 pages and should be formatted 
according to

the Springer’s Lecture Notes in Computer Science (LNCS) formatting guide.
Submissions are managed via EasyChair:
https://www.easychair.org/conferences/?conf=downscale2012

= Important dates =

* Submission deadline: March 4, 2012
* Notifications: April 1, 2012
* Camera ready version: April 15, 2012
* Workshop date: May 27 or 28, 2012

= Organization committee =

Christophe Guéret, Vrije Universiteit Amsterdam, Nederlands
Stefan Schlobach, Vrije Universiteit Amsterdam, Nederlands
Florent Pigout, Association OLPC France

= Program Committee =

Victor de Boer, Vrije Universiteit Amsterdam, Nederlands
Anna Bon, CIS Vrije Universiteit Amsterdam, Nederlands
Stephane Boyera, Web Foundation
Mathieu D’Aquin, KMi Open University, UK
Louiqa Raschid, University of Maryland, USA
Elena Simperl, KIT Karlshrue, Germany
Andreas Thor, University of Leipzig
Sameer Verma, San Francisco State University, USA
Maria Esther Vidal, Universidad Simón Bolívar, Venezuela
Jérôme David, INRIA Grenoble – Rhône-Alpes, France


First International Workshop on Downscaling the Semantic Web - DownScale2012
http://worldwidesemanticweb.wordpress.com/downscale2012/
May 27-28, 2012

co-located with the 9th Extended Semantic Web conference
May 27-31, 2012, Heraklion, Greece


= Objectives of the workshop =

Our current mind set as Semantic Web engineers is to focus on centralized and
very powerful solutions centred (and depending on ...) around Web hosted
servers and (mobile) clients accessing it. As a direct consequence of that, the
usage of Linked Data depends on the availability of a Web infrastructure
compassing data-centers, high speed reliable Internet connection and modern
client devices. If any of this is missing, our community is not able, yet, to
provide any Linked Data enabled data management solution. Still, the digital
divide that is currently widely recognized separates the world into those who
have access to Web-based platforms and those wh

Re: What do you get when you dereference the URI of a named graph?

[Kingsley Idehen]

On 1/4/12 11:13 AM, Frans Knibbe | Geodan wrote:

On 2012-01-04 16:54, Yrjana Rankka wrote:

On 1/4/12 17:42 , Yrjana Rankka wrote:

On 1/4/12 17:00 , Kingsley Idehen wrote:




Trouble is that there isn't consensus re. this matter.

For instance, one could assume that the URI / IRI of a named graph 
resolves to a description of said graph. That wouldn't really imply 
all the triples in the named graph :-)


Let's consider this situation:

GRAPH 
  "val1";
 "val2";
 "val3".

GRAPH 
 dc:created "somedate";
dc:modified "someotherdate";
dc:creator "Zaphod Beeblebrox".

A client dereferences 

What would you expect to get?

Cheers,


Oops. This was directed towards Frans, not Kingsley ;)


In that case, let me reply :-)

I was not really expecting anything in particular: data, metadata, or 
both. The background of my question is that I am trying to use a quad 
store, but I do not know how it should behave in this respect. Has 
Virtuoso made a decision on the matter?


Yes, if you want the have a de-referencable URI/IRI for a Named Graph. 
Make a description of said graph using its URI/IRI :-)


I can understand the option of returning a description of the graph, 
instead of its triples. In that way a named graph would behave like a 
data set, which is another collection of triples.


Hmm.

Think of the Named Graph as just another observation subject (a 
thing/entity)  with discernible attributes expressible in graph 
pictorial form via triples.



I am sure the RDF WG is fully aware of the pros and cons of all 
options and I wish them much wisdom in finding a solution for the 
problem. For me things have become clearer. I did not know that the 
issue is still in debate.


Problem is terminology overloading continues to cause us grief :-(


Regards,
Frans







--

Regards,

Kingsley Idehen 
Founder&  CEO
OpenLink Software
Company Web: http://www.openlinksw.com
Personal Weblog: http://www.openlinksw.com/blog/~kidehen
Twitter/Identi.ca handle: @kidehen
Google+ Profile: https://plus.google.com/112399767740508618350/about
LinkedIn Profile: http://www.linkedin.com/in/kidehen

Re: What do you get when you dereference the URI of a named graph?

[Frans Knibbe | Geodan]

On 2012-01-04 16:54, Yrjana Rankka wrote:

On 1/4/12 17:42 , Yrjana Rankka wrote:

On 1/4/12 17:00 , Kingsley Idehen wrote:




Trouble is that there isn't consensus re. this matter.

For instance, one could assume that the URI / IRI of a named graph 
resolves to a description of said graph. That wouldn't really imply 
all the triples in the named graph :-)


Let's consider this situation:

GRAPH 
  "val1";
 "val2";
 "val3".

GRAPH 
 dc:created "somedate";
dc:modified "someotherdate";
dc:creator "Zaphod Beeblebrox".

A client dereferences 

What would you expect to get?

Cheers,


Oops. This was directed towards Frans, not Kingsley ;)


In that case, let me reply :-)

I was not really expecting anything in particular: data, metadata, or 
both. The background of my question is that I am trying to use a quad 
store, but I do not know how it should behave in this respect. Has 
Virtuoso made a decision on the matter?


I can understand the option of returning a description of the graph, 
instead of its triples. In that way a named graph would behave like a 
data set, which is another collection of triples. I am sure the RDF WG 
is fully aware of the pros and cons of all options and I wish them much 
wisdom in finding a solution for the problem. For me things have become 
clearer. I did not know that the issue is still in debate.


Regards,
Frans

Re: What do you get when you dereference the URI of a named graph?

[Kingsley Idehen]

On 1/4/12 10:42 AM, Yrjana Rankka wrote:

On 1/4/12 17:00 , Kingsley Idehen wrote:




Trouble is that there isn't consensus re. this matter.

For instance, one could assume that the URI / IRI of a named graph 
resolves to a description of said graph. That wouldn't really imply 
all the triples in the named graph :-)


Let's consider this situation:

GRAPH 
  "val1";
 "val2";
 "val3".

GRAPH 
 dc:created "somedate";
dc:modified "someotherdate";
dc:creator "Zaphod Beeblebrox".

A client dereferences 

What would you expect to get?

Cheers,

SPARQL's use of GRAPH is the subject of intense debate as per Ivan's 
comment. At the current time, its just a *label* with SPARQL engine 
specific handling.


The example above demonstrates why Name Graph IRIs need clarity. Right 
now  -- as you know re. Virtuoso -- they serve as Identifiers for 
dataset partitioning, by default. If one really seeks a de-referencable 
URI/IRI for a named graph, then one should make triple based statements 
describing said named graph using its URI/IRI. Then you have a route to 
a Name that resolves to a description.


--

Regards,

Kingsley Idehen 
Founder&  CEO
OpenLink Software
Company Web: http://www.openlinksw.com
Personal Weblog: http://www.openlinksw.com/blog/~kidehen
Twitter/Identi.ca handle: @kidehen
Google+ Profile: https://plus.google.com/112399767740508618350/about
LinkedIn Profile: http://www.linkedin.com/in/kidehen

Re: What do you get when you dereference the URI of a named graph?

[Yrjana Rankka]

On 1/4/12 17:42 , Yrjana Rankka wrote:

On 1/4/12 17:00 , Kingsley Idehen wrote:




Trouble is that there isn't consensus re. this matter.

For instance, one could assume that the URI / IRI of a named graph 
resolves to a description of said graph. That wouldn't really imply 
all the triples in the named graph :-)


Let's consider this situation:

GRAPH 
  "val1";
 "val2";
 "val3".

GRAPH 
 dc:created "somedate";
dc:modified "someotherdate";
dc:creator "Zaphod Beeblebrox".

A client dereferences 

What would you expect to get?

Cheers,


Oops. This was directed towards Frans, not Kingsley ;)

--
Mr. Yrjana Rankka| gh...@openlinksw.com
Developer, Virtuoso Team | http://www.openlinksw.com
 | Making Technology Work For You

Re: What do you get when you dereference the URI of a named graph?

[Yrjana Rankka]

On 1/4/12 17:00 , Kingsley Idehen wrote:




Trouble is that there isn't consensus re. this matter.

For instance, one could assume that the URI / IRI of a named graph 
resolves to a description of said graph. That wouldn't really imply 
all the triples in the named graph :-)


Let's consider this situation:

GRAPH 
  "val1";
 "val2";
 "val3".

GRAPH 
 dc:created "somedate";
dc:modified "someotherdate";
dc:creator "Zaphod Beeblebrox".

A client dereferences 

What would you expect to get?

Cheers,

--
Mr. Yrjana Rankka| gh...@openlinksw.com
Developer, Virtuoso Team | http://www.openlinksw.com
 | Making Technology Work For You

Re: What do you get when you dereference the URI of a named graph?

[Ivan Herman]

Frans,

On Jan 4, 2012, at 15:24 , Frans Knibbe | Geodan wrote:

> Hello,
> 
> I have a (hopefully) simple question: What can you expect when you 
> dereference the URI of a named graph?

It is a simple question. The answer isn't: the RDF WG is currently trying to 
find a consensus on that since its inspection. There are about 4-500 mails on 
that subject in the WG's archive:-)

Ivan


> 
> I would expect the answer to be "all the triples that belong to that graph", 
> but I  could not find a source for such a mandate or consensus.
> 
> Thanks in advance,
> Frans
> 
> 
> 



Ivan Herman, W3C Semantic Web Activity Lead
Home: http://www.w3.org/People/Ivan/
mobile: +31-641044153
FOAF: http://www.ivan-herman.net/foaf.rdf







smime.p7s
Description: S/MIME cryptographic signature

Re: What do you get when you dereference the URI of a named graph?

[Hugh Glaser]

What do you get when you ask a question like this?
Possibly 404, but this could be real fun. :-)

On 4 Jan 2012, at 14:24, Frans Knibbe | Geodan wrote:

> Hello,
> 
> I have a (hopefully) simple question: What can you expect when you 
> dereference the URI of a named graph?
> 
> I would expect the answer to be "all the triples that belong to that graph", 
> but I  could not find a source for such a mandate or consensus.
> 
> Thanks in advance,
> Frans
> 
> 
> 

-- 
Hugh Glaser,  
 Web and Internet Science
 Electronics and Computer Science,
 University of Southampton,
 Southampton SO17 1BJ
Work: +44 23 8059 3670, Fax: +44 23 8059 3045
Mobile: +44 75 9533 4155 , Home: +44 23 8061 5652
http://www.ecs.soton.ac.uk/~hg/

Re: What do you get when you dereference the URI of a named graph?

[Kingsley Idehen]

On 1/4/12 9:24 AM, Frans Knibbe | Geodan wrote:

Hello,

I have a (hopefully) simple question: What can you expect when you 
dereference the URI of a named graph?


I would expect the answer to be "all the triples that belong to that 
graph", but I  could not find a source for such a mandate or consensus.


Thanks in advance,
Frans






Trouble is that there isn't consensus re. this matter.

For instance, one could assume that the URI / IRI of a named graph 
resolves to a description of said graph. That wouldn't really imply all 
the triples in the named graph :-)


--

Regards,

Kingsley Idehen 
Founder&  CEO
OpenLink Software
Company Web: http://www.openlinksw.com
Personal Weblog: http://www.openlinksw.com/blog/~kidehen
Twitter/Identi.ca handle: @kidehen
Google+ Profile: https://plus.google.com/112399767740508618350/about
LinkedIn Profile: http://www.linkedin.com/in/kidehen

Re: RDFa in HTML5

[Kingsley Idehen]

On 1/4/12 5:08 AM, Augusto Herrmann wrote:

The examples are displayed as (escaped) html code in the rightside
panel on the following page: http://vocab.e.gov.br/2011/03/vcge

People are meant to copy/paste the code, or just read and undestand,
in order to learn how to mark up their own pages stating that it's
about a subject in this controlled vocabulary. That's why we left the
reference to the page as an empty relative URL (which should resolve
to whatever address the page is loaded into).

But we also did eat our own dog food: that page also states it's about
the VCGE controlled vocabulary, by using RDFa 1.1 and Microdata like
this (lines 21-25):


   http://purl.org/dc/terms/subject";
content="http://vocab.e.gov.br/2011/03/vcge#esquema"; />


   http://schema.org/about";
content="http://vocab.e.gov.br/2011/03/vcge#esquema"; />

The triple that should be extracted from the RDFa is:

  dcterms:subject
  .

Best regards,
Augusto Herrmann
Open Data Team
Ministry of Planning, Budget&  Management - Brazil

On Tue, Jan 3, 2012 at 9:34 AM, Kingsley Idehen  wrote:

On 1/3/12 5:20 AM, Augusto Herrmann wrote:

Sorry, but I'm not sure what you mean by HTML5 resource types. Please
clarify. If you mean the microdata itemtype, the URL is there on the
Microdata example:http://schema.org/WebPage

Regards,
Augusto Herrmann


Do you have links to your sample HTML5 documents?


--

Regards,

Kingsley Idehen
Founder&CEO
OpenLink Software
Company Web: http://www.openlinksw.com
Personal Weblog: http://www.openlinksw.com/blog/~kidehen
Twitter/Identi.ca handle: @kidehen
Google+ Profile: https://plus.google.com/112399767740508618350/about
LinkedIn Profile: http://www.linkedin.com/in/kidehen










Augusto,

Awesome!

See:

1. 
http://linkeddata.uriburner.com/describe/?url=http%3A%2F%2Fvocab.e.gov.br%2F2011%2F03%2Fvcge%23imigrantes 



2. 
http://linkeddata.uriburner.com/fct/rdfdesc/usage.vsp?g=http%3A%2F%2Fvocab.e.gov.br%2F2011%2F03%2Fvcge%23imigrantes 
-- listed named graph IRIs showcases fact that we processed N3 and the 
Microdata with identical results .


--

Regards,

Kingsley Idehen 
Founder&  CEO
OpenLink Software
Company Web: http://www.openlinksw.com
Personal Weblog: http://www.openlinksw.com/blog/~kidehen
Twitter/Identi.ca handle: @kidehen
Google+ Profile: https://plus.google.com/112399767740508618350/about
LinkedIn Profile: http://www.linkedin.com/in/kidehen

What do you get when you dereference the URI of a named graph?

[Frans Knibbe | Geodan]

Hello,

I have a (hopefully) simple question: What can you expect when you 
dereference the URI of a named graph?


I would expect the answer to be "all the triples that belong to that 
graph", but I  could not find a source for such a mandate or consensus.


Thanks in advance,
Frans

Re: RDFa in HTML5

[Augusto Herrmann]

The examples are displayed as (escaped) html code in the rightside
panel on the following page: http://vocab.e.gov.br/2011/03/vcge

People are meant to copy/paste the code, or just read and undestand,
in order to learn how to mark up their own pages stating that it's
about a subject in this controlled vocabulary. That's why we left the
reference to the page as an empty relative URL (which should resolve
to whatever address the page is loaded into).

But we also did eat our own dog food: that page also states it's about
the VCGE controlled vocabulary, by using RDFa 1.1 and Microdata like
this (lines 21-25):


  http://purl.org/dc/terms/subject";
content="http://vocab.e.gov.br/2011/03/vcge#esquema"; />


  http://schema.org/about";
content="http://vocab.e.gov.br/2011/03/vcge#esquema"; />

The triple that should be extracted from the RDFa is:

 dcterms:subject
 .

Best regards,
Augusto Herrmann
Open Data Team
Ministry of Planning, Budget & Management - Brazil

On Tue, Jan 3, 2012 at 9:34 AM, Kingsley Idehen  wrote:
> On 1/3/12 5:20 AM, Augusto Herrmann wrote:
>>
>> Sorry, but I'm not sure what you mean by HTML5 resource types. Please
>> clarify. If you mean the microdata itemtype, the URL is there on the
>> Microdata example:http://schema.org/WebPage
>>
>> Regards,
>> Augusto Herrmann
>
>
> Do you have links to your sample HTML5 documents?
>
>
> --
>
> Regards,
>
> Kingsley Idehen
> Founder&  CEO
> OpenLink Software
> Company Web: http://www.openlinksw.com
> Personal Weblog: http://www.openlinksw.com/blog/~kidehen
> Twitter/Identi.ca handle: @kidehen
> Google+ Profile: https://plus.google.com/112399767740508618350/about
> LinkedIn Profile: http://www.linkedin.com/in/kidehen
>
>
>
>
>
>