- From: Tara Athan <taraathan@gmail.com>
- Date: Fri, 11 Jul 2014 03:51:07 -0400
- To: semantic-web@w3.org
On 7/10/14 10:59 AM, Pat Hayes wrote: > RDF is an assertional language, and by its very nature is capable of expressing contradictions. Aside from giving the same name to two different named graphs, what sort of contradictions can be expressed in RDF - without going to at least the RDFS entailment regime? Tara
Received on Friday, 11 July 2014 07:51:36 UTC