- From: Jimmy Cerra <jimbobbs@hotmail.com>
- Date: Wed, 30 Apr 2003 03:41:17 -0400
- To: <www-rdf-interest@w3.org>
Hey, Let's say we have the following N-Triples [1]: &e;#John &e;#age 22 &e;#John &rdf;#type &e;#Person &e;#Person &rdfs;#subClassOf &rdfs;#Class &e;#age &rdf;#type &rdf;#Property &e;#age &rdfs;#domain &e;#Person &e;#age &rdfs;#range &e;#Literal Could the above triples be represented by the following UML graph: See http://purl.org/jfc/2003/04/30-rdf2uml.gif I'm probably wrong, but at least this is a start. There seems to be very little information on the web about transforming UML graphs into RDF triples [2,3] - and nothing on the inverse relationship. The purpose is to find a more concise way (relative to the standard graphic notation) of representing RDF data that has been validated to an RDF-schema. -- James F. Cerra [1] Assume that the entities map to: e = http://www.example.com rdf = http://www.w3.org/1999/02/22-rdf-syntax-ns rdfs = http://www.w3.org/2000/01/rdf-schema [2] http://www.w3.org/TR/NOTE-rdf-uml/ [3] http://lists.w3.org/Archives/Public/www-rdf-interest/2000Apr/0069.html
Received on Wednesday, 30 April 2003 03:41:25 UTC