in IEXT(p) and in IEXT(IS(rdfs:range))
then in IEXT(IS(rdf:type)) [3.1.3]
if in IEXT(p) and in IEXT(IS(rdfs:range))
then y in LV
Yes, this last is a special case for rdfs:Literal, but so what!
if in IEXT(p) and in IEXT(IS(rdfs:domain))
then in IEXT(IS(rdf:type)) [3.1.4]
6/ Datatypes (general version)
Datatypes add extra structure to literals and literal values.
A datatype theory is a four-tuple
where LV is a collection of literal values
DT is a collection URIs that are also datatypes
DTC : DT -> powerset ( LV )
DTS : DT -> ( L -> LV ), with DTS(d) potentially partial
and DTS(d)(L) <= DTC(d) for all d
DTC maps a datatype to its extension (or value space).
DTS maps a datatype to a partial map from literals (or lexical space) to
literal values (or value space).
Each datatype provides at most one literal value for each literal via
the DTS mapping.
Given a datatype theory
define XLS(l) = { lv in LV : for some d in DT with DT(d) defined on l
lv = DT(d)(l) }
Given a datatype theory
a datatype RDFS model for a core RDFS graph R is a core RDFS model I for R,
with the following extra conditions:
if ~~ is in E with LN(n) in L
and in IEXT(IS(rdfs:range))
then for any node nc with LN(nc) in DT and IS(nc) = c
IS(n) = DTS(LN(nc))
for y in LV, if in IEXT(p) and ~~ in IEXT(IS(rdfs:range))
then for any node nc with LN(nc) in DT and IS(nc) = c
y = DTC(LN(nc))
These conditions are rather complicated for semantic conditions, so some
explanation is in orer. The first condition says that literals (n) that
are objects of statements must denote according to any datatype range for
the predicate (IS(p)) of the statement. The second condition says that
literals values (y) that are in relationships must belong to the value
space (DTC(LN(c))) of any range of the relationship.
7/ Datatypes (for XML Schema datatypes)
A XML Schema datatype theory is a datatype theory
where LV contains the value spaces of the primitive XML Schema datatypes
DT is the subset of URI of XML Schema datatypes, distinguished
either by their special names (e.g., xsd:integer) or by
``following'' them and finding an XML Schema datatype expression
DTC maps each d in DT to its value space
DTS maps each d in DT to its map from lexical space to value space
Given an XML Schema datatype theory T
an XML Schema datatype RDFS model for a core RDFS graph R is
a datatype RDFS model for R over T.