- From: Dan Connolly <connolly@w3.org>
- Date: Wed, 10 Oct 2001 08:00:32 -0500
- To: Pat Hayes <phayes@ai.uwf.edu>, w3c-rdfcore-wg@w3.org
Dan Connolly wrote: > > Pat Hayes wrote: > > > > >Consider this nice, clean graph model for RDF > > >(borrowing liberally from Peter F. Patel-Schneider's > > >message to www-rdf-logic of Thu, 27 Sep 2001 10:37:29 -0400): > > > > > >An RDF graph is a four-tuple (that can be considered to be a > > >partially labeled, directed graph; the unlabelled nodes > > >are bNodes) > > > < N, E, LN, LE > > > > where N is the set of nodes in the graph > > > LN :(partial) N -> URI u L gives labels for nodes > > > LE :(partial) E -> URI gives labels for edges > > > E <= N x N is the set of edges in the graph > > > > Why is LE partial? Is that deliberate? > > It was deliberate, yes. It evidently wasn't sufficiently > careful, though. Having thought it over, I think the syntax for the model theory should be, more or less, n-triples: An RDF graph is a set of triples <S, P, O>; each of S, P, O is a term; a term is either an absolute URI reference, a bNode, or a literal. -- Dan Connolly, W3C http://www.w3.org/People/Connolly/
Received on Wednesday, 10 October 2001 09:04:36 UTC