W3C home > Mailing lists > Public > w3c-rdfcore-wg@w3.org > February 2002

Re: simplified datatyping proposal

From: Patrick Stickler <patrick.stickler@nokia.com>
Date: Thu, 21 Feb 2002 10:41:57 +0200
To: Pat Hayes <phayes@ai.uwf.edu>
CC: RDF Core <w3c-rdfcore-wg@w3.org>
Message-ID: <B89A7F75.F352%patrick.stickler@nokia.com>
On 2002-02-20 19:56, "ext Pat Hayes" <phayes@ai.uwf.edu> wrote:

> I don't think that the union idea works mathematically, is the
> problem.

It does if you don't insist on literal nodes denoting a value.

If they consistently denote just a literal, and their treatment
as a lexical form denoting a value lives in the interpretation
alone, within the context of a datatype, then it works fine,
I think.

> as long as you are prepared to accept that this is a
> non-monotonic construction. That is going to stick in many craws,
> however.

RDFS range and domain constraints *are* non-monotonic. You can
have one range constraint in your graph, and I can have another
in my graph, and when we merge our graphs, both our values
will get different interpretations than for each graph separately.

Cest la vie.


Patrick Stickler              Phone: +358 50 483 9453
Senior Research Scientist     Fax:   +358 7180 35409
Nokia Research Center         Email: patrick.stickler@nokia.com
Received on Thursday, 21 February 2002 03:40:25 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 20:24:10 UTC