- From: Joshua Allen <joshuaa@microsoft.com>
- Date: Fri, 20 Feb 2004 11:10:35 -0800
- To: "Eric Jain" <Eric.Jain@isb-sib.ch>, "Lynn, James (Software Services)" <james.lynn@hp.com>
- Cc: "rdf-interest" <www-rdf-interest@w3.org>
Yeah, you could have a "degree of relationship" property and a "type of relationship" property. In n-triples: mailto:me foo:hasRelationship _b0 . _b0 foo:relationshipWith mailto:you . _b0 foo:relationshipType foo:professional . _b0 foo:relationshipIntensity "20" . However, I am very skeptical about how useful such taxonomies for classification of intrapersonal relationships are. Certainly they would be more expressive than the black-white distinction in places like Orkut, but it's arguable whether that increased expressiveness is particularly more accurate representation of reality (intrapersonal relationships are never precise or static). And the utility of such expressiveness is uncertain (what useful purpose could a software application have for a query like "show me e-mail addresses of people I am related to through foo:professional and > intensity 10?) -----Original Message----- From: www-rdf-interest-request@w3.org [mailto:www-rdf-interest-request@w3.org] On Behalf Of Eric Jain Sent: Friday, February 20, 2004 5:58 AM To: Lynn, James (Software Services) Cc: rdf-interest Subject: Re: SemWeb in Guardian newspaper > If we were talking about natural language, we would use adverbs. > I know him well. > I hardly know him. > I know him casually. > > In RDF, how can we constrain a predicate? I guess you could attach the well-hardly-casually qualifier to the statement itself, perhaps with a 'degreeOfKnowing' property. Or create subproperties 'knowsWell' etc.
Received on Friday, 20 February 2004 14:10:43 UTC