- From: Seth Russell <seth@robustai.net>
- Date: Fri, 20 Sep 2002 06:28:23 -0700
- To: Jeen Broekstra <jeen.broekstra@aidministrator.nl>
- CC: m batsis <mbatsis@netsmart.gr>, www-rdf-interest@w3.org
Jeen Broekstra wrote:
> By the way, most[1] inferencers over RDF Schema interpret the
> domain/range property semantics as inference rules rather than
> constraints, which basically means that whenever you introduce a
> property p with a certain range R (p rdfs:range R), and you introduce a
> instance a with that property (a p b), its value is automatically
> derived to be of type R (b rdf:type R).
But there is no way to define the property p
*using only the RDF and RDFS vocabulary*,
such that the RDF Model thory would entail
{ex:b rdf:type ex:R.}
from
{ex:p rdfs:range ex:R. ex:a ex:p ex:b.},
is there ?
Not that it's important ... im just curious, that's all ...
Seth Russell
Logic is great, survival is better.
Received on Friday, 20 September 2002 09:29:06 UTC