 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • |
Essentially,
DLP captures RDFS subset of DL --
plus a bit more.
|
|
|
| • |
RDFS
subset of DL permits the following statements:
|
|
|
|
– |
Class
C is Subclass of class D.
|
|
|
|
– |
Domain
of property P is class C.
|
|
|
|
– |
Range
restriction on property P is class D.
|
|
|
|
– |
Property
P is Subproperty of property Q.
|
|
|
|
– |
a is
an instance of class C.
|
|
|
|
– |
(a,b)
is an instance of property P.
|
|
|
| • |
DLP
also captures:
|
|
|
|
– |
Using
the Intersection connective (conjunction) in class descriptions
|
|
|
– |
Stating
that a property P is Transitive.
|
|
|
|
– |
Stating
that a property P is Symmetric.
|
|
|
| • |
DLP
can partially capture: most
other DL features.
|
|
|
| • |
Relevant
technical issue in LP:
|
|
|
|
– |
treatment
of equality, e.g., uniqueness of names.
|
|
