Foundations of Fuzzy Logic and Semantic Web Languages

Appendix A

RDFS Semantics and Inference Rules

For the sake of completeness, we reproduce here the definitions and axioms of

the normative semantics of RDFS [307, 362] consisting of a model theory and

axiomatic triples. We also recap a complete inference rule set.

The set rdfsV stands for the RDFS vocabulary and is illustrated in Ta-

ble A.1 with the shortcuts we use in brackets. The first column shows built-in

classes, and the second and third show built-in properties.

An interpretation I over a vocabulary V is a tuple

I = h∆

R

, ∆

P

, ∆

C

, ∆

L

, P [[·]], C[[·]], ·

I

i ,

where ∆

R

, ∆

P

, ∆

C

, ∆

L

are the interpretation domains of I, which are finite

non-empty sets, and ...