- From: Kingsley Idehen <kidehen@openlinksw.com>
- Date: Tue, 20 Nov 2012 13:15:46 -0500
- To: public-ldp-wg@w3.org
- Message-ID: <50ABC8D2.8050908@openlinksw.com>
On 11/20/12 12:57 PM, Wilde, Erik wrote: >> >The ldp: vocabulary already provides a way to expose the relation >> >between the two LDPRs, using ldp:membershipSubject and >> >ldp:membershipPredicate. What else is needed? > sorry, i don't quite follow you here. there has to be some way how a > client knows that composing the URI /bugs?inline=bugs:has_bug is a > sensible thing to do, right? how would it know that, without > knowing/finding rules how to do that? Once the first step is made re. accepting that this is achieved via RDF. We can then look into relations that make URI templates visible. Until we accept what we are doing, we won't be able to talk about discovery patterns in a coherent way. An RDF graph can also describe discovery patterns such that a client or a server can figure out URL patterns for specific interactions. This is beyond mime, its language understood by machines, since the entity relationship semantics are machine comprehensible, due to their first-order logic underpinnings. Simple URL pattern discovery example, using XRD (just another notation for representing and entity relationship graph): http://linkeddata.informatik.hu-berlin.de/uridbg/index.php?url=http%3A%2F%2Fkingsley.idehen.net%2F.well-known%2Fhost-meta&useragentheader=&acceptheader= -- 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
Attachments
- application/pkcs7-signature attachment: S/MIME Cryptographic Signature
Received on Tuesday, 20 November 2012 18:16:15 UTC