W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > October to December 2006

Agenda request: characterize the diffs between subgraph-matching and E-entailment

From: Eric Prud'hommeaux <eric@w3.org>
Date: Mon, 9 Oct 2006 16:21:05 +0200
To: RDF Data Access Working Group <public-rdf-dawg@w3.org>
Cc: Bijan Parsia <bparsia@isr.umd.edu>
Message-ID: <20061009142105.GA5395@w3.org>

On Mon, Oct 09, 2006 at 10:11:19AM +0100, Bijan Parsia wrote:
> The first line contains descriptive text with a link. the descriptive  
> text is:
> 
> 	""Open Issue: Should blank nodes be treated differently than  
> variables in the query pattern?."""
> 
> The linked to text is:
> 
> 	"""entailmentFramework
> 	I'm collecting all the issues related to entailment and SPARQL here  
> till either a
> 
> 	theme emerges or they get broken into separate issues.
> 
> 	Neatly summarized by FredZ here
> 	FredZ's request re: entailment framework and bnode scope
> 		others that are related here but lumped under separate heads 
> above..."""
> 
> So the first thing to recognize is that this is a catch all issue  
> rather than a specific focused issue, as is indicated by the last  
> line. So, it is confusing to have it "distilled" into a single  
> question, especially when that question is not broad but exceedingly  
> narrow.

Per Danbri's comments [DAN], if we will have Pat, Bijan and Fred, I
propose we work on some E-entailment semantics issues:

   1. does E-entailment support counting semantics?

   2. can we an express the differences between subgraph matching and
      E-entailment semantics in test cases?

Issues list identifier: entailmentFramework [ENT]

OWL example leaning on non-distinguished variables: [OWL]
Reduced version written as a test case: rdfSemantics/owl-lunch [LCH]

Some test cases to characterize the behavoir of the language
apparently not captured in the current semantics:

  bnode-type-var [CNT]: can we count duplicate results?

  bNode-constraint [BCN]: are bNode labels allowed in FILTERs?

  bNode-join [BJN]: do bNode lables bridge basic graph patterns?


[DAN] http://www.w3.org/mid/452622B3.9090202@danbri.org
[ENT] http://www.w3.org/2001/sw/DataAccess/issues#entailmentFramework
[OWL] http://www.w3.org/mid/20060713162342.GA12357@w3.org
[LNH] http://www.w3.org/2001/sw/DataAccess/tests/data/rdfSemantics/owl-lunch.ttl
      http://www.w3.org/2001/sw/DataAccess/tests/data/rdfSemantics/owl-lunch.rq
[CNT] http://www.w3.org/2001/sw/DataAccess/tests/#rdfsemantics-bnode-type-var
[BCN] http://www.w3.org/2001/sw/DataAccess/tests/#rdfsemantics-bNode-constraint
[BJN] http://www.w3.org/2001/sw/DataAccess/tests/#rdfsemantics-bNode-join
-- 
-eric

home-office: +1.617.395.1213 (usually 900-2300 CET)
	    +33.1.45.35.62.14
cell:       +33.6.73.84.87.26

(eric@w3.org)
Feel free to forward this message to any list for any purpose other than
email address distribution.
Received on Monday, 9 October 2006 14:20:07 GMT

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