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

Re: Modeling untidiness in tidy graphs

From: Pat Hayes <phayes@ai.uwf.edu>
Date: Thu, 31 Jan 2002 19:32:24 -0600
Message-Id: <p05101062b87f9f997164@[65.212.118.208]>
To: Sergey Melnik <melnik@db.stanford.edu>
Cc: w3c-rdfcore-wg@w3.org
>This is a side remark for those who like/need untidiness on literals for
>certain purposes.

Very diplomatically put. Untidy nodes are the kind of thing that are 
sold in plain unmarked wrappers, obviously.

>In a tidy graph model, untidiness can be modeled using bNodes.
>
>For example, an untidy graph
>
>_:a --dc:Title--> "Big Bang"
>_:b --my:book---> "Big Bang"

>can be represented e.g. as a tidy graph
>
>_:a --dc:Title--> _:1 --rdf:value--> "Big Bang"
>                                        ^
>                                        |
>_:b --my:book---> _:2 --rdf:value------+

Oh well, sure, if you use an 'rdf:value' idiom, they can.

BUt lets not argue about this. I now think that the MT can be made to 
work fine with tidy-literal graphs in any case, so I (for one) won't 
give you any more trouble about it.

Pat


-- 
---------------------------------------------------------------------
IHMC					(850)434 8903   home
40 South Alcaniz St.			(850)202 4416   office
Pensacola,  FL 32501			(850)202 4440   fax
phayes@ai.uwf.edu 
http://www.coginst.uwf.edu/~phayes
Received on Thursday, 31 January 2002 20:32:00 EST

This archive was generated by hypermail pre-2.1.9 : Wednesday, 3 September 2003 09:44:04 EDT