XDI TC Unofficial Telecon Agenda: Monday 10:00 - 11:30AM PT 2016-06-20

["=Drummond Reed" <drummond@respect.network>]

XDI TC Agenda

Following is the agenda for the unofficial telecon of the XDI TC held on:

Date: Monday, 20 June 2016 USA
Time: 10:00AM - 11:30AM Pacific Time (17:00-18:30 UTC)

The TC operates under a standing rule approved 17 July 2008 under which the TC does not hold regular official meetings and conducts all business by electronic ballot only. Unofficial weekly meetings are held to enable discussion among members but no business is conducted nor actions taken.

THE LINK TO THIS AGENDA AND LIVE MEETING NOTES IS:

https://docs.google.com/document/d/1t5Mx0ITqJdLwo8wM5GD9lcqehgbgnrhk-k2sERwc7J0/edit

Link to join from PC, Mac, iOS or Android:

https://zoom.us/j/925461490

Or join by phone:

   +1 408 638 0968 (US Toll) or +1 646 558 8656 (US Toll)

   Meeting ID: 925 461 490

   International numbers available:

https://zoom.us/zoomconference?m=9Lut7KQe_7FL6dRPEpvRh6OJU7UFyFPN  

IRC Channel: irc://irc.freenode.net:6667/xdi

AGENDA

How XDI Builds on RDF

The Introduction section of the XDI Core 1.0 spec includes references to a planned document from the XDI TC entitled “How XDI Builds on RDF”. We have not yet authored this document, but the need for it is growing. Developers need to know how XDI as a semantic messaging and data sharing protocol differs from RDF and Linked Data Platform (LDP) and why they may want to use XDI.

We will review the following table prepared by Drummond and Markus to be included in the “How XDI Builds on RDF” document:

#	XDI Feature	Comparison to RDF and LDP
1	Semantic tree graph model provides 100% addressability of all graph nodes	RDF graphs nodes are not uniquely addressable and RDF blank nodes are not addressable outside an RDF graph
2	Uniform context model across 100% of XDI graph nodes	RDF 1.1 provides only one level of graph nesting and is not addressable
3	Simple, highly efficient reification using inner graphs	RDF reification is notoriously difficult and complex; the XDI solution requires the XDI semantic tree graph model
4	Full P2P protocol for semantic messaging and data interchange	RDF is not a protocol and Linked Data Platform is immature
5	Link contracts and policy expressions	These feature require the XDI semantic tree graph model; they would be extremely complex to describe in RDF
6	XDI dictionaries provide highly reusable semantic definitions (the equivalent of natural language words)	This feature requires the XDI semantic tree graph model; it would be very complex to describe in RDF
7	Clear legal chains of authority for data and policies	This feature requires the XDI semantic tree graph model; it would be very complex to describe in RDF
8	Simple, standard, uniform versioning model for 100% of XDI graphs	This feature requires the XDI semantic tree graph model; it would be very complex to describe in RDF
9	Discoverable immutable addresses	RDF resource URIs can use URN syntax to indicate persistence, but there is no standard URN discovery protocol
10	Absolute and relative addresses usable at any level of a semantic tree	RDF resource URIs are all absolute; blank node addresses are relative only to the containing RDF graph

JSON-XD and XDI Dictionaries

We will discuss continue our discussion of JSON-XD, a developer-friendly XDI serialization format inspired by the RDF-based JSON-LD format:

https://wiki.oasis-open.org/xdi/JsonXdiMapping

https://server.xdi2.org/XDIConverter?sample=8

The focus of this discussion will be expressing XDI dictionaries in JSON-XD and exploring how close this format would end out being to JSON Schema.

NEXT REGULAR CALL

The next call will be the following week at the usual time (Monday 10AM PT). The link to where agenda items can be posted for the next meeting is: https://docs.google.com/document/d/19oDl0lbb56Grehx2a5flZnhrgnua5l8cVvC_dJ8fTXk/edit?usp=sharing