- From: Jan Grant <Jan.Grant@bristol.ac.uk>
- Date: Fri, 23 Aug 2002 12:02:48 +0100 (BST)
- To: Patrick.Stickler@nokia.com
- cc: w3c-rdfcore-wg <w3c-rdfcore-wg@w3.org>
On Fri, 23 Aug 2002 Patrick.Stickler@nokia.com wrote: > > On Thu, 22 Aug 2002 Patrick.Stickler@nokia.com wrote: > > > > > It also reinforces, IMO, the fact that the typed literal > > node is a pairing > > > of a datatype and a literal, the latter having its own > > three-part structure > > > of XML bit, string, and language code. > > > > I'm not convinced that this is a "fact". > > Well, fair enough. > > One could also consider literals to be quads, made up > of datatype, lexical form, XML bit, and lang. > > I'm OK with either. How are you disposed towards (datatype, stuff) where stuff may or may not be further structured? jan -- jan grant, ILRT, University of Bristol. http://www.ilrt.bris.ac.uk/ Tel +44(0)117 9287088 Fax +44 (0)117 9287112 RFC822 jan.grant@bris.ac.uk Theoremhood is positively decidable. It just takes time at least exponential in the length of the proof.
Received on Friday, 23 August 2002 07:03:26 UTC