|
|
|
In this slide
some aspects are discussed that are typical for the Semantic Web and that an
reasoning engine for RDF has to take into account.
|
|
• subquestions:
|
|
as was shown in
the case study, it must be possible for the inferencing program to direct
queries to other sites and get answers in return.
|
|
• closed/open world: this will be explained in a
following slide
|
|
• verifiability/trust -> origin
|
|
databases and
results must be verifiable i.e. it must be necessary to check whether a RDF
triple can be accepted or not. The link with the trust system is obvious.
Verifiability/trust points also to the necessity of keeping track of the
origin off all triples and within a triple of its labels (not all labels of a
triple are necessarily originating from the same site).
|
|
• inconsistencies
|
|
While recieving
information from many different sites, the danger of inconsistency is higher
as in a stand-alone application.
|
|
|