W3C home > Mailing lists > Public > public-sparql-dev@w3.org > July to September 2010

Re: First order logic and SPARQL

From: Bob MacGregor <bob.macgregor@gmail.com>
Date: Sun, 5 Sep 2010 22:13:24 -0700
Message-ID: <AANLkTin=_EWvDapC398-Ok8-rh7kSCJD0gVQ_HeSFYoa@mail.gmail.com>
To: Pat Hayes <phayes@ihmc.us>
Cc: Adrian Walker <adriandwalker@gmail.com>, semantic-web@w3.org, public-sparql-dev@w3.org
Hi Pat,

On Sun, Sep 5, 2010 at 6:31 PM, Pat Hayes <phayes@ihmc.us> wrote:

On Sep 5, 2010, at 4:48 PM, Bob MacGregor wrote:

> My personal interest is in a query language for RDF that's easy to use,
and, among other things,
> has a negation operator that is intuitive.

Id be interested to know what you consider to be intuitive here. Is negation
by failure intuitive for most Web sources? Do you routinely conclude, from a
failure to find a sentence asserted on a website, that it is false?

Fundamental to your argument seems to be "sentence asserted on a website".
If I grabbed
triples from some random Website, I might not be confident in using NAF.
But I don't do that.  I work
with graphs that I've built from sources I trust, and I know which parts of
the graph are expected to
be complete, and NAF is perfect for those parts.

- Bob
Received on Monday, 6 September 2010 05:13:57 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:15:50 UTC