- From: Patrick Stickler <patrick.stickler@nokia.com>
- Date: Fri, 11 Jan 2002 14:23:33 +0200
- To: RDF Core <w3c-rdfcore-wg@w3.org>
- Message-ID: <B864A5EC.B670%patrick.stickler@nokia.com>
Since my prose seems to typically cause more confusion than clarity, I've attempted to capture the key ideas in pictures... Attached is a set of illustrations/diagrams showing the PDU "Pairing" Data Typing model and interpretations for the P, P+, D, and U idioms based on that Model. Note specifically: 1. The node which denotes/represents the value of a property is always the object node of the statement in which that property serves as the predicate, regardless of where the literal (lexical form) or data type (URIref) are defined. 2. The pairing defined by each idiom is based on the node labels (literal and URIref) not the nodes themselves. I intend to incorporate these into the summary of PD(U) to be reviewed alongside the existing description of S. Questions are of course welcome. Cheers, Patrick -- Patrick Stickler Phone: +358 50 483 9453 Senior Research Scientist Fax: +358 7180 35409 Nokia Research Center Email: patrick.stickler@nokia.com
Attachments
- image/png attachment: Slide1.png
- image/png attachment: Slide2.png
- image/png attachment: Slide4.png
- image/png attachment: Slide3.png
- image/png attachment: Slide5.png
Received on Friday, 11 January 2002 07:23:01 UTC