W3C home > Mailing lists > Public > public-owl-dev@w3.org > October to December 2008

Re: Issue with unbounded alphabets in datatypes

From: Bijan Parsia <bparsia@cs.man.ac.uk>
Date: Mon, 20 Oct 2008 22:33:08 +0100
Message-Id: <31FF8502-2F44-417D-B84E-1D20053C5FB4@cs.man.ac.uk>
Cc: Owl Dev <public-owl-dev@w3.org>, Jie Bao <baojie@cs.rpi.edu>, axel@polleres.net, W3C OWL Working Group <public-owl-wg@w3.org>
To: "Birte Glimm" <birte.glimm@comlab.ox.ac.uk>

[OWL WG, please see:

Hi Birte,

On Oct 20, 2008, at 6:28 PM, Birte Glimm wrote:

> Hi all,
> I just wanted to raise a discussion about the currently proposed
> assumption that the alphabet of the String-based datatypes is
> unbounded.

I'm just wondering which text you think requires that. For  
xsd:string, it clearly seems that there is a finite alphabet:

Oh, but rdf:text:
doesn't seem to have any constraint on alphabet.

Though in:

we read:
"""rdf:text (http://www.w3.org/2007/rif#text, for text strings with  
language tags attached).

This symbol space represents text strings with a language tag  
attached. The lexical space of rdf:text is the set of all Unicode  
strings of the form ...@LANG, i.e., strings that end with @LANG where  
LANG is a language identifier as defined in [BCP-47]"""

which seems to restrict it to Unicode (3.0?) strings.

I agree that allowing an unbounded alphabet is absurd. XML has had to  
face this as well. I think we should suck it up.

I've cced the editors of the rdf:text document so they can take note  
of the issue.

Received on Monday, 20 October 2008 21:33:49 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:58:17 UTC