W3C home > Mailing lists > Public > www-rdf-logic@w3.org > December 2003

rdf(s) decidablity?

From: lsp <lsp@is.pku.edu.cn>
Date: Fri, 5 Dec 2003 01:20:47 +0800
To: <www-rdf-logic@w3.org>
Message-ID: <000001c3ba8a$f4fd4cc0$ab4669a2@tcl.is.pku.edu.cn>
In [1] section 3.1: 
   "although RDFS seems to be a very simple language (much too simple
for many Semantic Web applications), its transformation into FOL is not
included in any of the above mentioned decidable fragments."
 
Is this mean that RDFS is undecidable? Is there any formal proof?
 
As regards to RDF Model Theory, is there any complexity results about
rdfs entailment?
 
Thanks!
 
Liu shengping
 
[1] Ian Horrocks, Peter F. Patel-Schneider , Three Theses of
Representation in the Semantic Web, WWW2003.
 
Received on Thursday, 4 December 2003 12:26:49 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 7 December 2009 10:52:47 GMT