W3C home > Mailing lists > Public > www-mobile@w3.org > June 2002

Re: CC/PP, RDF, DAML and Knowledge Representation (clarification)

From: Graham Klyne <GK@NineByNine.org>
Date: Fri, 07 Jun 2002 19:04:01 +0100
Message-Id: <5.1.0.14.2.20020607190247.03ba71f0@joy.songbird.com>
To: "Butler, Mark" <Mark_Butler@hplb.hpl.hp.com>
Cc: "'www-mobile@w3.org'" <www-mobile@w3.org>, "'w3c-ccpp-wg@w3.org'" <w3c-ccpp-wg@w3.org>

At 06:43 PM 6/7/02 +0100, Graham Klyne wrote:
>As it stands, RDF embodies the notion of conjunction -- logical AND -- an 
>RDF graph is true if all of its constituent statements are true.  So while 
>core RDF can express that A AND B are true, it has no way to express that 
>their disjunction (A OR B) is true.  DAML adds semantics to the base of 
>RDF which allow for disjunctions to be expressed.  (To get a feel for the 
>capabilities of DAML, look for some of the old papers on CLASSIC -- I 
>found [2] was particularly useful.)

I should have said CLASSIC (and I presume DAML) supports a *limited* sense 
of disjunction.

#g


-------------------
Graham Klyne
<GK@NineByNine.org>
Received on Friday, 7 June 2002 13:50:58 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 6 April 2009 13:00:01 GMT