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

Re: "OWL" Entailment

From: Bijan Parsia <bparsia@cs.man.ac.uk>
Date: Thu, 7 May 2009 12:35:16 +0100
Message-Id: <2FFBECD9-44F0-4FFD-8E91-E879DC11EEC5@cs.man.ac.uk>
Cc: SPARQL Working Group <public-rdf-dawg@w3.org>
To: Ivan Herman <ivan@w3.org>
On 7 May 2009, at 12:11, Ivan Herman wrote:

> Bijan Parsia wrote:
>>
>>> RDFS might be similar (disregarding the issue of infinite triple
>>> generation with rdf:_n, but the approach in Herman ter Horst's paper
>>> might take care of making that finite...)
>>
>> ?
>
> He looks at the graph, finds the maximum 'n' for which rdf:_n is in  
> the
> graph, and uses the axiomatic triples for rdf:_i 0<=i<=n only. It  
> is not
> kosher from the standard point of view, but it works for  
> applications...

I understand that...I just didn't understand what it had to do with  
contradiction :)

Yes, this is a way of bounding answers derived by entailment. RDFS  
has to consider it. Another way is to forbid "built in properties"  
from the solution set of ?x rdf:type rdf:Property.

Cheers,
Bijan.
Received on Thursday, 7 May 2009 11:31:25 GMT

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