W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > April to June 2004

Re: disjunction implementation

From: Dan Connolly <connolly@w3.org>
Date: Mon, 14 Jun 2004 16:00:46 -0500
To: Eric Prud'hommeaux <eric@w3.org>
Cc: RDF Data Access Working Group <public-rdf-dawg@w3.org>, Rob Shearer <Rob.Shearer@networkinference.com>
Message-Id: <1087246846.21030.1861.camel@dirk>

On Fri, 2004-06-11 at 22:38, Eric Prud'hommeaux wrote:
> I'm a dork. I sent out an optional arcs impelementation. I was supposed
> to send disjunction implementation.

Specifically, w.r.t. 3.4 Subgraph Results
http://www.w3.org/TR/2004/WD-rdf-dawg-uc-20040602/#r3.4


I'm not sure I understand this. (more below...)

[...]
> TEST CASE:
> 
>   ns <http://example.org/n#>
>   assert (
>    A0 p1 B .
>   # A0 p2 C .
>   # A0 p3 D .
>   
>   # A1 p1 B .
>    A1 p2 C .
>   # A1 p3 D .
>   
>   # A2 p1 B .
>   # A2 p2 C .
>    A2 p3 D .
>   
>   # A3 p1 B .
>    A3 p2 C .
>    A3 p3 D )
>   
>   ask (
>    ( ?n p2 C || ?n p3 D ))
>   
>   collect (?n)
> 
> TEST RUN OUTPUT:
> 
> For W3C::Rdf::AlgaeCompileTree::UnionDisjunction:
> 
> +-------------------------+
> |                        n|
> |-------------------------|
> |<http://example.org/n#A1>|
> |<http://example.org/n#A3>|
> |<http://example.org/n#A3>|
> |<http://example.org/n#A2>|
> +-------------------------+
> or with "proofs"
> +-------------------------+----------------------------------------------------+
> |                        n|                                                    |
> |-------------------------|----------------------------------------------------|
> |<http://example.org/n#A3>|                                                    |
> |<http://example.org/n#A3> <http://example.org/n#p2> <http://example.org/n#C> .|
> |   -->{<file://na/home/eric/sources/public/perl/modules/W3C/Rdf/bin/run.sh>}  |
> |------------------------------------------------------------------------------|
> |<http://example.org/n#A1>|                                                    |
> |<http://example.org/n#A1> <http://example.org/n#p2> <http://example.org/n#C> .|
> |   -->{<file://na/home/eric/sources/public/perl/modules/W3C/Rdf/bin/run.sh>}  |
> |------------------------------------------------------------------------------|
> |<http://example.org/n#A2>|                                                    |
> |<http://example.org/n#A2> <http://example.org/n#p3> <http://example.org/n#D> .|
> |   -->{<file://na/home/eric/sources/public/perl/modules/W3C/Rdf/bin/run.sh>}  |
> |------------------------------------------------------------------------------|
> |<http://example.org/n#A3>|                                                    |
> |<http://example.org/n#A3> <http://example.org/n#p3> <http://example.org/n#D> .|
> |   -->{<file://na/home/eric/sources/public/perl/modules/W3C/Rdf/bin/run.sh>}  |
> +-------------------------+----------------------------------------------------+

I don't understand this... answer. What we're looking for
is the "the smallest subgraph that matches the query (i.e. the subgraph
that gives the same results as the query on the original graph)" right?

(quoting from http://www.joseki.org/client_app.html)

So... which subgraph does Algae return when asked for a subgraph?

Also...
The example Rob gave in his message of Tue, 8 Jun 2004 07:45:54 -0700
"find everyone who is friends with Eddie or friends with Jane"
is more concrete. Please consider using it.


-- 
Dan Connolly, W3C http://www.w3.org/People/Connolly/
Received on Monday, 14 June 2004 17:00:03 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 16:15:19 GMT